./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/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 aefcaabd16a50e389998bb4544e72a90e6b18c44 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:59:23,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:59:23,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:59:23,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:59:23,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:59:23,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:59:23,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:59:23,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:59:23,305 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:59:23,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:59:23,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:59:23,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:59:23,308 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:59:23,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:59:23,309 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:59:23,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:59:23,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:59:23,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:59:23,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:59:23,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:59:23,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:59:23,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:59:23,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:59:23,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:59:23,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:59:23,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:59:23,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:59:23,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:59:23,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:59:23,322 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:59:23,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:59:23,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:59:23,323 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:59:23,323 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:59:23,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:59:23,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:59:23,325 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 01:59:23,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:59:23,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:59:23,337 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:59:23,337 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:59:23,338 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:59:23,338 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:59:23,338 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:59:23,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:59:23,338 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:59:23,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:59:23,339 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:59:23,339 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:59:23,339 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:59:23,339 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:59:23,339 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:59:23,339 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:59:23,340 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:59:23,340 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:59:23,340 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:59:23,340 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:59:23,340 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:59:23,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:59:23,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:59:23,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:59:23,341 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:59:23,341 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:59:23,341 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:59:23,341 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:59:23,341 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:59:23,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:59:23,342 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_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/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 -> aefcaabd16a50e389998bb4544e72a90e6b18c44 [2018-11-23 01:59:23,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:59:23,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:59:23,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:59:23,384 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:59:23,384 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:59:23,385 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-23 01:59:23,438 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/data/ea79cff32/576785d45cd14dbd9a101a050f983d6e/FLAG033e384c1 [2018-11-23 01:59:23,981 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:59:23,982 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-23 01:59:24,008 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/data/ea79cff32/576785d45cd14dbd9a101a050f983d6e/FLAG033e384c1 [2018-11-23 01:59:24,458 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/data/ea79cff32/576785d45cd14dbd9a101a050f983d6e [2018-11-23 01:59:24,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:59:24,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:59:24,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:59:24,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:59:24,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:59:24,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:24" (1/1) ... [2018-11-23 01:59:24,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e23415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:24, skipping insertion in model container [2018-11-23 01:59:24,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:24" (1/1) ... [2018-11-23 01:59:24,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:59:24,543 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:59:25,422 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:59:25,452 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:59:25,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:59:25,722 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:59:25,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25 WrapperNode [2018-11-23 01:59:25,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:59:25,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:59:25,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:59:25,723 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:59:25,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:59:25,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:59:25,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:59:25,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:59:25,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... [2018-11-23 01:59:25,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:59:25,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:59:25,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:59:25,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:59:25,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/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-23 01:59:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-11-23 01:59:26,047 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-11-23 01:59:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-23 01:59:26,047 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-23 01:59:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-23 01:59:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:59:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:59:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-23 01:59:26,048 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-23 01:59:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-23 01:59:26,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-23 01:59:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-23 01:59:26,048 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-23 01:59:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-23 01:59:26,049 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-23 01:59:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-23 01:59:26,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-23 01:59:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-23 01:59:26,050 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-23 01:59:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-23 01:59:26,050 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-23 01:59:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-23 01:59:26,050 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-23 01:59:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-23 01:59:26,050 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-23 01:59:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyReadWrite [2018-11-23 01:59:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyReadWrite [2018-11-23 01:59:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-23 01:59:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-23 01:59:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-23 01:59:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-23 01:59:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:59:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2018-11-23 01:59:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2018-11-23 01:59:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-23 01:59:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-23 01:59:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 01:59:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 01:59:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-11-23 01:59:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-11-23 01:59:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-23 01:59:26,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-23 01:59:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 01:59:26,053 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 01:59:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-23 01:59:26,053 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-23 01:59:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-23 01:59:26,054 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-23 01:59:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:59:26,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:59:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-23 01:59:26,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-23 01:59:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-23 01:59:26,055 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-23 01:59:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-23 01:59:26,055 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-23 01:59:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:59:26,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:59:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2018-11-23 01:59:26,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2018-11-23 01:59:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:59:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 01:59:26,056 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 01:59:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-23 01:59:26,056 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-23 01:59:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:59:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 01:59:26,056 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 01:59:26,056 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 01:59:26,057 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 01:59:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2018-11-23 01:59:26,057 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2018-11-23 01:59:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-23 01:59:26,057 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-23 01:59:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:59:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-23 01:59:26,057 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-23 01:59:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPower [2018-11-23 01:59:26,058 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPower [2018-11-23 01:59:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 01:59:26,058 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 01:59:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2018-11-23 01:59:26,058 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2018-11-23 01:59:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyUnload [2018-11-23 01:59:26,058 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyUnload [2018-11-23 01:59:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-23 01:59:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-23 01:59:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2018-11-23 01:59:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2018-11-23 01:59:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-11-23 01:59:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-11-23 01:59:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 01:59:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-11-23 01:59:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-11-23 01:59:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-23 01:59:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-23 01:59:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-23 01:59:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-23 01:59:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-23 01:59:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-23 01:59:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:59:26,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:59:26,528 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:26,528 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:30,038 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:30,038 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:34,967 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:34,967 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:35,069 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:35,069 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:39,427 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:39,427 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:39,443 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:39,443 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:41,842 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:41,842 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:41,852 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:41,853 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:41,868 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:41,868 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:43,979 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:43,979 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:43,996 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:43,996 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:44,020 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:44,021 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:46,274 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:46,274 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:46,329 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:46,329 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:46,340 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:46,341 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:46,347 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:46,347 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:47,269 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:47,269 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:51,130 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:51,130 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:53,200 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:59:53,200 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:59:53,216 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:59:53,216 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 01:59:53,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:53 BoogieIcfgContainer [2018-11-23 01:59:53,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:59:53,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:59:53,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:59:53,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:59:53,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:59:24" (1/3) ... [2018-11-23 01:59:53,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f63c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:53, skipping insertion in model container [2018-11-23 01:59:53,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:25" (2/3) ... [2018-11-23 01:59:53,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f63c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:53, skipping insertion in model container [2018-11-23 01:59:53,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:53" (3/3) ... [2018-11-23 01:59:53,223 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-23 01:59:53,233 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:59:53,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:59:53,254 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:59:53,281 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:59:53,282 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:59:53,282 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:59:53,282 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:59:53,282 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:59:53,282 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:59:53,282 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:59:53,283 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:59:53,283 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:59:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states. [2018-11-23 01:59:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 01:59:53,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:53,314 INFO L402 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-23 01:59:53,316 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:53,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:53,320 INFO L82 PathProgramCache]: Analyzing trace with hash -511056672, now seen corresponding path program 1 times [2018-11-23 01:59:53,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:53,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:53,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:53,766 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-23 01:59:53,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:53,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:59:53,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:59:53,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:59:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:59:53,788 INFO L87 Difference]: Start difference. First operand 668 states. Second operand 3 states. [2018-11-23 01:59:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:54,073 INFO L93 Difference]: Finished difference Result 1255 states and 1863 transitions. [2018-11-23 01:59:54,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:59:54,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 01:59:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:54,091 INFO L225 Difference]: With dead ends: 1255 [2018-11-23 01:59:54,091 INFO L226 Difference]: Without dead ends: 662 [2018-11-23 01:59:54,099 INFO L631 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-23 01:59:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-11-23 01:59:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2018-11-23 01:59:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-11-23 01:59:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 920 transitions. [2018-11-23 01:59:54,180 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 920 transitions. Word has length 31 [2018-11-23 01:59:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:54,181 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 920 transitions. [2018-11-23 01:59:54,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:59:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 920 transitions. [2018-11-23 01:59:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 01:59:54,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:54,183 INFO L402 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] [2018-11-23 01:59:54,183 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:54,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash 471036786, now seen corresponding path program 1 times [2018-11-23 01:59:54,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:54,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:54,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:54,355 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-23 01:59:54,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:54,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:59:54,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:59:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:59:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:59:54,357 INFO L87 Difference]: Start difference. First operand 662 states and 920 transitions. Second operand 3 states. [2018-11-23 01:59:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:54,652 INFO L93 Difference]: Finished difference Result 1606 states and 2255 transitions. [2018-11-23 01:59:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:59:54,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 01:59:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:54,661 INFO L225 Difference]: With dead ends: 1606 [2018-11-23 01:59:54,661 INFO L226 Difference]: Without dead ends: 1128 [2018-11-23 01:59:54,663 INFO L631 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-23 01:59:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2018-11-23 01:59:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1109. [2018-11-23 01:59:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-11-23 01:59:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1556 transitions. [2018-11-23 01:59:54,719 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1556 transitions. Word has length 36 [2018-11-23 01:59:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:54,719 INFO L480 AbstractCegarLoop]: Abstraction has 1109 states and 1556 transitions. [2018-11-23 01:59:54,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:59:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1556 transitions. [2018-11-23 01:59:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 01:59:54,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:54,722 INFO L402 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] [2018-11-23 01:59:54,722 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:54,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash -834812890, now seen corresponding path program 1 times [2018-11-23 01:59:54,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:54,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:54,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:54,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:54,912 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-23 01:59:54,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:54,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:59:54,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:59:54,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:59:54,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:59:54,913 INFO L87 Difference]: Start difference. First operand 1109 states and 1556 transitions. Second operand 3 states. [2018-11-23 01:59:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:55,018 INFO L93 Difference]: Finished difference Result 1841 states and 2617 transitions. [2018-11-23 01:59:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:59:55,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 01:59:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:55,026 INFO L225 Difference]: With dead ends: 1841 [2018-11-23 01:59:55,026 INFO L226 Difference]: Without dead ends: 1822 [2018-11-23 01:59:55,028 INFO L631 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-23 01:59:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2018-11-23 01:59:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1760. [2018-11-23 01:59:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1760 states. [2018-11-23 01:59:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2519 transitions. [2018-11-23 01:59:55,083 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2519 transitions. Word has length 48 [2018-11-23 01:59:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:55,084 INFO L480 AbstractCegarLoop]: Abstraction has 1760 states and 2519 transitions. [2018-11-23 01:59:55,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:59:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2519 transitions. [2018-11-23 01:59:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:59:55,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:55,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:59:55,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:55,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:55,087 INFO L82 PathProgramCache]: Analyzing trace with hash -372310683, now seen corresponding path program 1 times [2018-11-23 01:59:55,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:55,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:55,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:55,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:55,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:55,302 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-23 01:59:55,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:55,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:59:55,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:59:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:59:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:59:55,304 INFO L87 Difference]: Start difference. First operand 1760 states and 2519 transitions. Second operand 3 states. [2018-11-23 01:59:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:55,462 INFO L93 Difference]: Finished difference Result 1809 states and 2588 transitions. [2018-11-23 01:59:55,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:59:55,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-23 01:59:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:55,469 INFO L225 Difference]: With dead ends: 1809 [2018-11-23 01:59:55,469 INFO L226 Difference]: Without dead ends: 1805 [2018-11-23 01:59:55,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:59:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-11-23 01:59:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1797. [2018-11-23 01:59:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-11-23 01:59:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2570 transitions. [2018-11-23 01:59:55,520 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2570 transitions. Word has length 49 [2018-11-23 01:59:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:55,521 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2570 transitions. [2018-11-23 01:59:55,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:59:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2570 transitions. [2018-11-23 01:59:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:59:55,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:55,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:59:55,523 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:55,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1617429212, now seen corresponding path program 1 times [2018-11-23 01:59:55,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:55,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:55,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:55,694 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-23 01:59:55,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:55,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:59:55,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:59:55,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:59:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:59:55,695 INFO L87 Difference]: Start difference. First operand 1797 states and 2570 transitions. Second operand 3 states. [2018-11-23 01:59:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:55,957 INFO L93 Difference]: Finished difference Result 3152 states and 4572 transitions. [2018-11-23 01:59:55,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:59:55,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-23 01:59:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:55,967 INFO L225 Difference]: With dead ends: 3152 [2018-11-23 01:59:55,967 INFO L226 Difference]: Without dead ends: 3149 [2018-11-23 01:59:55,969 INFO L631 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-23 01:59:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2018-11-23 01:59:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 2949. [2018-11-23 01:59:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2018-11-23 01:59:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4256 transitions. [2018-11-23 01:59:56,050 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4256 transitions. Word has length 49 [2018-11-23 01:59:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:56,050 INFO L480 AbstractCegarLoop]: Abstraction has 2949 states and 4256 transitions. [2018-11-23 01:59:56,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:59:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4256 transitions. [2018-11-23 01:59:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 01:59:56,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:56,052 INFO L402 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-23 01:59:56,052 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:56,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1634690754, now seen corresponding path program 1 times [2018-11-23 01:59:56,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:56,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:56,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:56,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:56,171 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-23 01:59:56,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:56,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:59:56,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:59:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:59:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:59:56,172 INFO L87 Difference]: Start difference. First operand 2949 states and 4256 transitions. Second operand 3 states. [2018-11-23 01:59:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:56,344 INFO L93 Difference]: Finished difference Result 3552 states and 5167 transitions. [2018-11-23 01:59:56,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:59:56,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 01:59:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:56,356 INFO L225 Difference]: With dead ends: 3552 [2018-11-23 01:59:56,356 INFO L226 Difference]: Without dead ends: 3547 [2018-11-23 01:59:56,358 INFO L631 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-23 01:59:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2018-11-23 01:59:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3475. [2018-11-23 01:59:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3475 states. [2018-11-23 01:59:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 5026 transitions. [2018-11-23 01:59:56,445 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 5026 transitions. Word has length 51 [2018-11-23 01:59:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:56,446 INFO L480 AbstractCegarLoop]: Abstraction has 3475 states and 5026 transitions. [2018-11-23 01:59:56,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:59:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 5026 transitions. [2018-11-23 01:59:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 01:59:56,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:56,447 INFO L402 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-23 01:59:56,447 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:56,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1637492475, now seen corresponding path program 1 times [2018-11-23 01:59:56,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:56,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:56,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:56,625 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-23 01:59:56,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:56,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:59:56,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:59:56,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:59:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:59:56,627 INFO L87 Difference]: Start difference. First operand 3475 states and 5026 transitions. Second operand 5 states. [2018-11-23 01:59:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:58,867 INFO L93 Difference]: Finished difference Result 6838 states and 9892 transitions. [2018-11-23 01:59:58,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:59:58,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-23 01:59:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:58,884 INFO L225 Difference]: With dead ends: 6838 [2018-11-23 01:59:58,884 INFO L226 Difference]: Without dead ends: 3642 [2018-11-23 01:59:58,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:59:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2018-11-23 01:59:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3469. [2018-11-23 01:59:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2018-11-23 01:59:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 5012 transitions. [2018-11-23 01:59:59,052 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 5012 transitions. Word has length 50 [2018-11-23 01:59:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:59,052 INFO L480 AbstractCegarLoop]: Abstraction has 3469 states and 5012 transitions. [2018-11-23 01:59:59,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:59:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 5012 transitions. [2018-11-23 01:59:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 01:59:59,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:59,055 INFO L402 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-23 01:59:59,055 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:59,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750973, now seen corresponding path program 1 times [2018-11-23 01:59:59,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:59,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:59,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:59,246 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-23 01:59:59,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:59,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:59:59,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:59:59,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:59:59,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:59:59,248 INFO L87 Difference]: Start difference. First operand 3469 states and 5012 transitions. Second operand 5 states. [2018-11-23 02:00:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:00,313 INFO L93 Difference]: Finished difference Result 3553 states and 5158 transitions. [2018-11-23 02:00:00,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:00:00,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-23 02:00:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:00,325 INFO L225 Difference]: With dead ends: 3553 [2018-11-23 02:00:00,325 INFO L226 Difference]: Without dead ends: 3547 [2018-11-23 02:00:00,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:00:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2018-11-23 02:00:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3469. [2018-11-23 02:00:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2018-11-23 02:00:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 5011 transitions. [2018-11-23 02:00:00,424 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 5011 transitions. Word has length 51 [2018-11-23 02:00:00,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:00,424 INFO L480 AbstractCegarLoop]: Abstraction has 3469 states and 5011 transitions. [2018-11-23 02:00:00,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 5011 transitions. [2018-11-23 02:00:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 02:00:00,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:00,426 INFO L402 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-23 02:00:00,426 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:00,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -63833082, now seen corresponding path program 1 times [2018-11-23 02:00:00,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:00,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:00,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:00,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:00,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:00,667 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-23 02:00:00,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:00,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:00,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:00,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:00,668 INFO L87 Difference]: Start difference. First operand 3469 states and 5011 transitions. Second operand 5 states. [2018-11-23 02:00:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:01,536 INFO L93 Difference]: Finished difference Result 3549 states and 5152 transitions. [2018-11-23 02:00:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:00:01,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-23 02:00:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:01,552 INFO L225 Difference]: With dead ends: 3549 [2018-11-23 02:00:01,552 INFO L226 Difference]: Without dead ends: 3543 [2018-11-23 02:00:01,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:00:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2018-11-23 02:00:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3469. [2018-11-23 02:00:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2018-11-23 02:00:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 5010 transitions. [2018-11-23 02:00:01,700 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 5010 transitions. Word has length 52 [2018-11-23 02:00:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:01,701 INFO L480 AbstractCegarLoop]: Abstraction has 3469 states and 5010 transitions. [2018-11-23 02:00:01,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 5010 transitions. [2018-11-23 02:00:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 02:00:01,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:01,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:01,702 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:01,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:01,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1895884084, now seen corresponding path program 1 times [2018-11-23 02:00:01,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:01,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:01,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:01,874 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-23 02:00:01,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:01,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:01,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:01,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:01,876 INFO L87 Difference]: Start difference. First operand 3469 states and 5010 transitions. Second operand 5 states. [2018-11-23 02:00:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:02,003 INFO L93 Difference]: Finished difference Result 3484 states and 5026 transitions. [2018-11-23 02:00:02,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:00:02,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-23 02:00:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:02,018 INFO L225 Difference]: With dead ends: 3484 [2018-11-23 02:00:02,018 INFO L226 Difference]: Without dead ends: 3467 [2018-11-23 02:00:02,020 INFO L631 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-23 02:00:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-23 02:00:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3467. [2018-11-23 02:00:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3467 states. [2018-11-23 02:00:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3467 states to 3467 states and 5006 transitions. [2018-11-23 02:00:02,170 INFO L78 Accepts]: Start accepts. Automaton has 3467 states and 5006 transitions. Word has length 53 [2018-11-23 02:00:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:02,171 INFO L480 AbstractCegarLoop]: Abstraction has 3467 states and 5006 transitions. [2018-11-23 02:00:02,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 5006 transitions. [2018-11-23 02:00:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 02:00:02,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:02,172 INFO L402 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-23 02:00:02,172 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:02,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1084495785, now seen corresponding path program 1 times [2018-11-23 02:00:02,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:02,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:02,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:02,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:02,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:02,394 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-23 02:00:02,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:02,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:02,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:02,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:02,395 INFO L87 Difference]: Start difference. First operand 3467 states and 5006 transitions. Second operand 3 states. [2018-11-23 02:00:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:02,701 INFO L93 Difference]: Finished difference Result 9737 states and 14256 transitions. [2018-11-23 02:00:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:00:02,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-23 02:00:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:02,727 INFO L225 Difference]: With dead ends: 9737 [2018-11-23 02:00:02,727 INFO L226 Difference]: Without dead ends: 6507 [2018-11-23 02:00:02,742 INFO L631 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-23 02:00:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6507 states. [2018-11-23 02:00:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6507 to 6453. [2018-11-23 02:00:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6453 states. [2018-11-23 02:00:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6453 states to 6453 states and 9435 transitions. [2018-11-23 02:00:03,133 INFO L78 Accepts]: Start accepts. Automaton has 6453 states and 9435 transitions. Word has length 55 [2018-11-23 02:00:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:03,133 INFO L480 AbstractCegarLoop]: Abstraction has 6453 states and 9435 transitions. [2018-11-23 02:00:03,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:00:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6453 states and 9435 transitions. [2018-11-23 02:00:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 02:00:03,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:03,135 INFO L402 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-23 02:00:03,135 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:03,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:03,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1548730819, now seen corresponding path program 1 times [2018-11-23 02:00:03,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:03,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:03,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:03,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:03,292 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-23 02:00:03,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:03,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:03,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:03,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:03,293 INFO L87 Difference]: Start difference. First operand 6453 states and 9435 transitions. Second operand 5 states. [2018-11-23 02:00:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:03,490 INFO L93 Difference]: Finished difference Result 6468 states and 9451 transitions. [2018-11-23 02:00:03,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:00:03,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-23 02:00:03,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:03,516 INFO L225 Difference]: With dead ends: 6468 [2018-11-23 02:00:03,516 INFO L226 Difference]: Without dead ends: 6446 [2018-11-23 02:00:03,520 INFO L631 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-23 02:00:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6446 states. [2018-11-23 02:00:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6446 to 6446. [2018-11-23 02:00:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6446 states. [2018-11-23 02:00:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 9426 transitions. [2018-11-23 02:00:03,785 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 9426 transitions. Word has length 54 [2018-11-23 02:00:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:03,785 INFO L480 AbstractCegarLoop]: Abstraction has 6446 states and 9426 transitions. [2018-11-23 02:00:03,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 9426 transitions. [2018-11-23 02:00:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 02:00:03,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:03,787 INFO L402 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-23 02:00:03,787 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:03,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash -585046777, now seen corresponding path program 1 times [2018-11-23 02:00:03,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:03,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:03,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:03,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:03,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:03,932 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-23 02:00:03,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:03,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:03,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:03,933 INFO L87 Difference]: Start difference. First operand 6446 states and 9426 transitions. Second operand 3 states. [2018-11-23 02:00:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:06,164 INFO L93 Difference]: Finished difference Result 12159 states and 17964 transitions. [2018-11-23 02:00:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:00:06,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-23 02:00:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:06,187 INFO L225 Difference]: With dead ends: 12159 [2018-11-23 02:00:06,188 INFO L226 Difference]: Without dead ends: 6638 [2018-11-23 02:00:06,208 INFO L631 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-23 02:00:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2018-11-23 02:00:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6550. [2018-11-23 02:00:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6550 states. [2018-11-23 02:00:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6550 states to 6550 states and 9546 transitions. [2018-11-23 02:00:06,469 INFO L78 Accepts]: Start accepts. Automaton has 6550 states and 9546 transitions. Word has length 55 [2018-11-23 02:00:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:06,469 INFO L480 AbstractCegarLoop]: Abstraction has 6550 states and 9546 transitions. [2018-11-23 02:00:06,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:00:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6550 states and 9546 transitions. [2018-11-23 02:00:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 02:00:06,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:06,471 INFO L402 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-23 02:00:06,471 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:06,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:06,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2034422637, now seen corresponding path program 1 times [2018-11-23 02:00:06,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:06,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:00:06,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:06,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:06,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:06,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:06,657 INFO L87 Difference]: Start difference. First operand 6550 states and 9546 transitions. Second operand 5 states. [2018-11-23 02:00:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:06,902 INFO L93 Difference]: Finished difference Result 6574 states and 9588 transitions. [2018-11-23 02:00:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:00:06,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-23 02:00:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:06,916 INFO L225 Difference]: With dead ends: 6574 [2018-11-23 02:00:06,916 INFO L226 Difference]: Without dead ends: 6558 [2018-11-23 02:00:06,918 INFO L631 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-23 02:00:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2018-11-23 02:00:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6556. [2018-11-23 02:00:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6556 states. [2018-11-23 02:00:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6556 states to 6556 states and 9564 transitions. [2018-11-23 02:00:07,083 INFO L78 Accepts]: Start accepts. Automaton has 6556 states and 9564 transitions. Word has length 58 [2018-11-23 02:00:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:07,084 INFO L480 AbstractCegarLoop]: Abstraction has 6556 states and 9564 transitions. [2018-11-23 02:00:07,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6556 states and 9564 transitions. [2018-11-23 02:00:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 02:00:07,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:07,085 INFO L402 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] [2018-11-23 02:00:07,085 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:07,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash -869179256, now seen corresponding path program 1 times [2018-11-23 02:00:07,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:07,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:07,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:07,210 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-23 02:00:07,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:07,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:07,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:07,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:07,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:07,212 INFO L87 Difference]: Start difference. First operand 6556 states and 9564 transitions. Second operand 5 states. [2018-11-23 02:00:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:07,337 INFO L93 Difference]: Finished difference Result 6574 states and 9583 transitions. [2018-11-23 02:00:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:00:07,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-23 02:00:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:07,351 INFO L225 Difference]: With dead ends: 6574 [2018-11-23 02:00:07,352 INFO L226 Difference]: Without dead ends: 6554 [2018-11-23 02:00:07,354 INFO L631 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-23 02:00:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6554 states. [2018-11-23 02:00:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6554 to 6554. [2018-11-23 02:00:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6554 states. [2018-11-23 02:00:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 9560 transitions. [2018-11-23 02:00:07,501 INFO L78 Accepts]: Start accepts. Automaton has 6554 states and 9560 transitions. Word has length 59 [2018-11-23 02:00:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:07,501 INFO L480 AbstractCegarLoop]: Abstraction has 6554 states and 9560 transitions. [2018-11-23 02:00:07,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 6554 states and 9560 transitions. [2018-11-23 02:00:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 02:00:07,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:07,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:07,503 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:07,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1088802169, now seen corresponding path program 1 times [2018-11-23 02:00:07,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:07,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:07,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:07,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:07,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:07,630 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-23 02:00:07,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:07,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:07,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:07,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:07,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:07,631 INFO L87 Difference]: Start difference. First operand 6554 states and 9560 transitions. Second operand 5 states. [2018-11-23 02:00:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:07,745 INFO L93 Difference]: Finished difference Result 6569 states and 9576 transitions. [2018-11-23 02:00:07,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:00:07,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 02:00:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:07,758 INFO L225 Difference]: With dead ends: 6569 [2018-11-23 02:00:07,758 INFO L226 Difference]: Without dead ends: 6549 [2018-11-23 02:00:07,760 INFO L631 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-23 02:00:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2018-11-23 02:00:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 6549. [2018-11-23 02:00:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6549 states. [2018-11-23 02:00:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 9553 transitions. [2018-11-23 02:00:07,910 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 9553 transitions. Word has length 61 [2018-11-23 02:00:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:07,910 INFO L480 AbstractCegarLoop]: Abstraction has 6549 states and 9553 transitions. [2018-11-23 02:00:07,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 9553 transitions. [2018-11-23 02:00:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 02:00:07,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:07,912 INFO L402 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] [2018-11-23 02:00:07,912 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:07,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1764736213, now seen corresponding path program 1 times [2018-11-23 02:00:07,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:07,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:07,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:07,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:07,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:00:08,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:08,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:00:08,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:00:08,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:00:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:00:08,057 INFO L87 Difference]: Start difference. First operand 6549 states and 9553 transitions. Second operand 7 states. [2018-11-23 02:00:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:26,220 INFO L93 Difference]: Finished difference Result 11848 states and 17540 transitions. [2018-11-23 02:00:26,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:00:26,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-11-23 02:00:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:26,249 INFO L225 Difference]: With dead ends: 11848 [2018-11-23 02:00:26,249 INFO L226 Difference]: Without dead ends: 8169 [2018-11-23 02:00:26,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:00:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8169 states. [2018-11-23 02:00:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8169 to 7399. [2018-11-23 02:00:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7399 states. [2018-11-23 02:00:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7399 states to 7399 states and 10863 transitions. [2018-11-23 02:00:26,580 INFO L78 Accepts]: Start accepts. Automaton has 7399 states and 10863 transitions. Word has length 62 [2018-11-23 02:00:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:26,580 INFO L480 AbstractCegarLoop]: Abstraction has 7399 states and 10863 transitions. [2018-11-23 02:00:26,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:00:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 7399 states and 10863 transitions. [2018-11-23 02:00:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 02:00:26,582 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:26,582 INFO L402 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-23 02:00:26,583 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:26,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash -669335226, now seen corresponding path program 1 times [2018-11-23 02:00:26,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:26,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:26,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:26,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:26,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:26,776 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-23 02:00:26,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:26,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:26,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:26,777 INFO L87 Difference]: Start difference. First operand 7399 states and 10863 transitions. Second operand 5 states. [2018-11-23 02:00:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:29,092 INFO L93 Difference]: Finished difference Result 13912 states and 20687 transitions. [2018-11-23 02:00:29,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:00:29,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 02:00:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:29,119 INFO L225 Difference]: With dead ends: 13912 [2018-11-23 02:00:29,119 INFO L226 Difference]: Without dead ends: 7579 [2018-11-23 02:00:29,139 INFO L631 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-23 02:00:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2018-11-23 02:00:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 7525. [2018-11-23 02:00:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7525 states. [2018-11-23 02:00:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 11042 transitions. [2018-11-23 02:00:29,568 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 11042 transitions. Word has length 63 [2018-11-23 02:00:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:29,568 INFO L480 AbstractCegarLoop]: Abstraction has 7525 states and 11042 transitions. [2018-11-23 02:00:29,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 11042 transitions. [2018-11-23 02:00:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 02:00:29,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:29,571 INFO L402 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-23 02:00:29,571 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:29,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash -656745517, now seen corresponding path program 1 times [2018-11-23 02:00:29,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:29,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:29,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:29,755 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-23 02:00:29,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:29,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:29,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:29,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:29,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:29,756 INFO L87 Difference]: Start difference. First operand 7525 states and 11042 transitions. Second operand 3 states. [2018-11-23 02:00:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:32,032 INFO L93 Difference]: Finished difference Result 14106 states and 20957 transitions. [2018-11-23 02:00:32,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:00:32,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-23 02:00:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:32,055 INFO L225 Difference]: With dead ends: 14106 [2018-11-23 02:00:32,055 INFO L226 Difference]: Without dead ends: 7647 [2018-11-23 02:00:32,074 INFO L631 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-23 02:00:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7647 states. [2018-11-23 02:00:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7647 to 7565. [2018-11-23 02:00:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7565 states. [2018-11-23 02:00:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7565 states to 7565 states and 11082 transitions. [2018-11-23 02:00:32,405 INFO L78 Accepts]: Start accepts. Automaton has 7565 states and 11082 transitions. Word has length 63 [2018-11-23 02:00:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:32,405 INFO L480 AbstractCegarLoop]: Abstraction has 7565 states and 11082 transitions. [2018-11-23 02:00:32,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:00:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7565 states and 11082 transitions. [2018-11-23 02:00:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 02:00:32,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:32,406 INFO L402 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-23 02:00:32,407 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:32,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1157662224, now seen corresponding path program 1 times [2018-11-23 02:00:32,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:32,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:32,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:32,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:32,562 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-23 02:00:32,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:32,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:32,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:32,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:32,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:32,563 INFO L87 Difference]: Start difference. First operand 7565 states and 11082 transitions. Second operand 3 states. [2018-11-23 02:00:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:32,972 INFO L93 Difference]: Finished difference Result 10389 states and 15440 transitions. [2018-11-23 02:00:32,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:00:32,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-23 02:00:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:32,991 INFO L225 Difference]: With dead ends: 10389 [2018-11-23 02:00:32,991 INFO L226 Difference]: Without dead ends: 10376 [2018-11-23 02:00:32,995 INFO L631 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-23 02:00:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10376 states. [2018-11-23 02:00:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10376 to 8844. [2018-11-23 02:00:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2018-11-23 02:00:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 12996 transitions. [2018-11-23 02:00:33,255 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 12996 transitions. Word has length 64 [2018-11-23 02:00:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:33,256 INFO L480 AbstractCegarLoop]: Abstraction has 8844 states and 12996 transitions. [2018-11-23 02:00:33,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:00:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 12996 transitions. [2018-11-23 02:00:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 02:00:33,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:33,258 INFO L402 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-23 02:00:33,258 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:33,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 689789680, now seen corresponding path program 1 times [2018-11-23 02:00:33,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:33,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:33,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:33,436 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-23 02:00:33,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:33,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:00:33,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:00:33,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:00:33,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:00:33,438 INFO L87 Difference]: Start difference. First operand 8844 states and 12996 transitions. Second operand 7 states. [2018-11-23 02:00:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:46,387 INFO L93 Difference]: Finished difference Result 13063 states and 19100 transitions. [2018-11-23 02:00:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:00:46,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-11-23 02:00:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:46,403 INFO L225 Difference]: With dead ends: 13063 [2018-11-23 02:00:46,403 INFO L226 Difference]: Without dead ends: 8623 [2018-11-23 02:00:46,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:00:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8623 states. [2018-11-23 02:00:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8623 to 7412. [2018-11-23 02:00:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7412 states. [2018-11-23 02:00:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 10704 transitions. [2018-11-23 02:00:46,644 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 10704 transitions. Word has length 64 [2018-11-23 02:00:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:46,644 INFO L480 AbstractCegarLoop]: Abstraction has 7412 states and 10704 transitions. [2018-11-23 02:00:46,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:00:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 10704 transitions. [2018-11-23 02:00:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 02:00:46,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:46,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:46,646 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:46,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:46,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1076470422, now seen corresponding path program 1 times [2018-11-23 02:00:46,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:46,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:46,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:46,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:46,793 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-23 02:00:46,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:46,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:00:46,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:00:46,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:00:46,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:00:46,794 INFO L87 Difference]: Start difference. First operand 7412 states and 10704 transitions. Second operand 8 states. [2018-11-23 02:00:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:47,378 INFO L93 Difference]: Finished difference Result 7436 states and 10765 transitions. [2018-11-23 02:00:47,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:00:47,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-23 02:00:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:47,391 INFO L225 Difference]: With dead ends: 7436 [2018-11-23 02:00:47,391 INFO L226 Difference]: Without dead ends: 7432 [2018-11-23 02:00:47,394 INFO L631 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-23 02:00:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7432 states. [2018-11-23 02:00:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7432 to 7422. [2018-11-23 02:00:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7422 states. [2018-11-23 02:00:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7422 states to 7422 states and 10729 transitions. [2018-11-23 02:00:47,620 INFO L78 Accepts]: Start accepts. Automaton has 7422 states and 10729 transitions. Word has length 65 [2018-11-23 02:00:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:47,620 INFO L480 AbstractCegarLoop]: Abstraction has 7422 states and 10729 transitions. [2018-11-23 02:00:47,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:00:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 7422 states and 10729 transitions. [2018-11-23 02:00:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 02:00:47,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:47,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:47,623 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:47,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:47,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1076747252, now seen corresponding path program 1 times [2018-11-23 02:00:47,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:47,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:47,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:47,749 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-23 02:00:47,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:47,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:47,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:47,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:47,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:47,750 INFO L87 Difference]: Start difference. First operand 7422 states and 10729 transitions. Second operand 5 states. [2018-11-23 02:00:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:48,912 INFO L93 Difference]: Finished difference Result 8904 states and 12991 transitions. [2018-11-23 02:00:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:00:48,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-23 02:00:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:48,927 INFO L225 Difference]: With dead ends: 8904 [2018-11-23 02:00:48,927 INFO L226 Difference]: Without dead ends: 8890 [2018-11-23 02:00:48,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:00:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8890 states. [2018-11-23 02:00:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8890 to 7427. [2018-11-23 02:00:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7427 states. [2018-11-23 02:00:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 10738 transitions. [2018-11-23 02:00:49,178 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 10738 transitions. Word has length 65 [2018-11-23 02:00:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:49,178 INFO L480 AbstractCegarLoop]: Abstraction has 7427 states and 10738 transitions. [2018-11-23 02:00:49,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 10738 transitions. [2018-11-23 02:00:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 02:00:49,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:49,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:49,180 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:49,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1021879576, now seen corresponding path program 1 times [2018-11-23 02:00:49,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:49,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:49,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:49,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:49,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:49,341 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-23 02:00:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:49,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:00:49,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:00:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:00:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:00:49,342 INFO L87 Difference]: Start difference. First operand 7427 states and 10738 transitions. Second operand 8 states. [2018-11-23 02:00:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:49,715 INFO L93 Difference]: Finished difference Result 7440 states and 10752 transitions. [2018-11-23 02:00:49,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:00:49,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-23 02:00:49,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:49,726 INFO L225 Difference]: With dead ends: 7440 [2018-11-23 02:00:49,726 INFO L226 Difference]: Without dead ends: 7390 [2018-11-23 02:00:49,729 INFO L631 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-23 02:00:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7390 states. [2018-11-23 02:00:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7390 to 7390. [2018-11-23 02:00:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2018-11-23 02:00:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 10688 transitions. [2018-11-23 02:00:49,962 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 10688 transitions. Word has length 65 [2018-11-23 02:00:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:49,962 INFO L480 AbstractCegarLoop]: Abstraction has 7390 states and 10688 transitions. [2018-11-23 02:00:49,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:00:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 10688 transitions. [2018-11-23 02:00:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 02:00:49,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:49,964 INFO L402 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-23 02:00:49,964 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:49,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1892310757, now seen corresponding path program 1 times [2018-11-23 02:00:49,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:49,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:49,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:50,072 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-23 02:00:50,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:50,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:50,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:50,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:50,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:50,073 INFO L87 Difference]: Start difference. First operand 7390 states and 10688 transitions. Second operand 3 states. [2018-11-23 02:00:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:50,378 INFO L93 Difference]: Finished difference Result 10698 states and 15519 transitions. [2018-11-23 02:00:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:00:50,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-23 02:00:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:50,391 INFO L225 Difference]: With dead ends: 10698 [2018-11-23 02:00:50,391 INFO L226 Difference]: Without dead ends: 7291 [2018-11-23 02:00:50,398 INFO L631 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-23 02:00:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7291 states. [2018-11-23 02:00:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7291 to 7228. [2018-11-23 02:00:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7228 states. [2018-11-23 02:00:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7228 states to 7228 states and 10435 transitions. [2018-11-23 02:00:50,753 INFO L78 Accepts]: Start accepts. Automaton has 7228 states and 10435 transitions. Word has length 68 [2018-11-23 02:00:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:50,753 INFO L480 AbstractCegarLoop]: Abstraction has 7228 states and 10435 transitions. [2018-11-23 02:00:50,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:00:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7228 states and 10435 transitions. [2018-11-23 02:00:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 02:00:50,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:50,755 INFO L402 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-23 02:00:50,755 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:50,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1850728286, now seen corresponding path program 1 times [2018-11-23 02:00:50,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:50,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:50,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:50,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:50,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:50,850 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-23 02:00:50,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:50,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:50,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:50,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:50,851 INFO L87 Difference]: Start difference. First operand 7228 states and 10435 transitions. Second operand 3 states. [2018-11-23 02:00:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:53,162 INFO L93 Difference]: Finished difference Result 13489 states and 19665 transitions. [2018-11-23 02:00:53,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:00:53,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-23 02:00:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:53,175 INFO L225 Difference]: With dead ends: 13489 [2018-11-23 02:00:53,175 INFO L226 Difference]: Without dead ends: 7278 [2018-11-23 02:00:53,185 INFO L631 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-23 02:00:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7278 states. [2018-11-23 02:00:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7278 to 7118. [2018-11-23 02:00:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7118 states. [2018-11-23 02:00:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7118 states to 7118 states and 10283 transitions. [2018-11-23 02:00:53,419 INFO L78 Accepts]: Start accepts. Automaton has 7118 states and 10283 transitions. Word has length 68 [2018-11-23 02:00:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:53,420 INFO L480 AbstractCegarLoop]: Abstraction has 7118 states and 10283 transitions. [2018-11-23 02:00:53,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:00:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7118 states and 10283 transitions. [2018-11-23 02:00:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 02:00:53,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:53,422 INFO L402 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] [2018-11-23 02:00:53,422 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:53,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash -662187367, now seen corresponding path program 1 times [2018-11-23 02:00:53,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:53,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:53,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:53,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:53,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:53,511 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-23 02:00:53,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:53,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:53,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:53,512 INFO L87 Difference]: Start difference. First operand 7118 states and 10283 transitions. Second operand 3 states. [2018-11-23 02:00:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:55,798 INFO L93 Difference]: Finished difference Result 13341 states and 19510 transitions. [2018-11-23 02:00:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:00:55,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-23 02:00:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:55,811 INFO L225 Difference]: With dead ends: 13341 [2018-11-23 02:00:55,811 INFO L226 Difference]: Without dead ends: 7240 [2018-11-23 02:00:55,824 INFO L631 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-23 02:00:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7240 states. [2018-11-23 02:00:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7240 to 7134. [2018-11-23 02:00:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2018-11-23 02:00:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 10299 transitions. [2018-11-23 02:00:56,036 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 10299 transitions. Word has length 66 [2018-11-23 02:00:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:56,036 INFO L480 AbstractCegarLoop]: Abstraction has 7134 states and 10299 transitions. [2018-11-23 02:00:56,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:00:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 10299 transitions. [2018-11-23 02:00:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 02:00:56,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:56,038 INFO L402 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] [2018-11-23 02:00:56,038 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:56,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash -394437316, now seen corresponding path program 1 times [2018-11-23 02:00:56,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:56,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:56,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:56,150 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-23 02:00:56,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:56,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:00:56,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:00:56,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:00:56,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:00:56,151 INFO L87 Difference]: Start difference. First operand 7134 states and 10299 transitions. Second operand 4 states. [2018-11-23 02:00:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:56,867 INFO L93 Difference]: Finished difference Result 8989 states and 12921 transitions. [2018-11-23 02:00:56,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:00:56,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-23 02:00:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:56,875 INFO L225 Difference]: With dead ends: 8989 [2018-11-23 02:00:56,875 INFO L226 Difference]: Without dead ends: 5265 [2018-11-23 02:00:56,879 INFO L631 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-23 02:00:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2018-11-23 02:00:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 4756. [2018-11-23 02:00:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4756 states. [2018-11-23 02:00:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 6764 transitions. [2018-11-23 02:00:57,071 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 6764 transitions. Word has length 73 [2018-11-23 02:00:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:57,071 INFO L480 AbstractCegarLoop]: Abstraction has 4756 states and 6764 transitions. [2018-11-23 02:00:57,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:00:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 6764 transitions. [2018-11-23 02:00:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 02:00:57,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:57,073 INFO L402 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-23 02:00:57,074 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:57,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash -536765924, now seen corresponding path program 1 times [2018-11-23 02:00:57,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:57,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:57,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:57,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:57,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:57,166 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-23 02:00:57,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:57,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:57,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:57,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:57,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:57,167 INFO L87 Difference]: Start difference. First operand 4756 states and 6764 transitions. Second operand 3 states. [2018-11-23 02:00:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:59,408 INFO L93 Difference]: Finished difference Result 6938 states and 9897 transitions. [2018-11-23 02:00:59,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:00:59,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-23 02:00:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:59,416 INFO L225 Difference]: With dead ends: 6938 [2018-11-23 02:00:59,416 INFO L226 Difference]: Without dead ends: 4958 [2018-11-23 02:00:59,420 INFO L631 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-23 02:00:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2018-11-23 02:00:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4860. [2018-11-23 02:00:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4860 states. [2018-11-23 02:00:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 6923 transitions. [2018-11-23 02:00:59,605 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 6923 transitions. Word has length 70 [2018-11-23 02:00:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:59,606 INFO L480 AbstractCegarLoop]: Abstraction has 4860 states and 6923 transitions. [2018-11-23 02:00:59,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:00:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 6923 transitions. [2018-11-23 02:00:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 02:00:59,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:59,607 INFO L402 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-23 02:00:59,607 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:59,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash -961844848, now seen corresponding path program 1 times [2018-11-23 02:00:59,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:59,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:59,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:59,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:59,689 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-23 02:00:59,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:59,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:00:59,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:00:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:00:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:00:59,690 INFO L87 Difference]: Start difference. First operand 4860 states and 6923 transitions. Second operand 3 states. [2018-11-23 02:01:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:01,950 INFO L93 Difference]: Finished difference Result 6934 states and 9869 transitions. [2018-11-23 02:01:01,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:01:01,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-23 02:01:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:01,961 INFO L225 Difference]: With dead ends: 6934 [2018-11-23 02:01:01,962 INFO L226 Difference]: Without dead ends: 4904 [2018-11-23 02:01:01,968 INFO L631 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-23 02:01:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2018-11-23 02:01:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4804. [2018-11-23 02:01:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2018-11-23 02:01:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6859 transitions. [2018-11-23 02:01:02,182 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6859 transitions. Word has length 71 [2018-11-23 02:01:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:02,182 INFO L480 AbstractCegarLoop]: Abstraction has 4804 states and 6859 transitions. [2018-11-23 02:01:02,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:01:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6859 transitions. [2018-11-23 02:01:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 02:01:02,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:02,184 INFO L402 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-23 02:01:02,184 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:02,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash -275555004, now seen corresponding path program 1 times [2018-11-23 02:01:02,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:02,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:02,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:02,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:02,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:01:02,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:02,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:01:02,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:01:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:01:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:02,311 INFO L87 Difference]: Start difference. First operand 4804 states and 6859 transitions. Second operand 8 states. [2018-11-23 02:01:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:02,709 INFO L93 Difference]: Finished difference Result 4820 states and 6876 transitions. [2018-11-23 02:01:02,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:01:02,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-11-23 02:01:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:02,716 INFO L225 Difference]: With dead ends: 4820 [2018-11-23 02:01:02,716 INFO L226 Difference]: Without dead ends: 4800 [2018-11-23 02:01:02,717 INFO L631 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-23 02:01:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2018-11-23 02:01:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4800. [2018-11-23 02:01:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4800 states. [2018-11-23 02:01:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4800 states to 4800 states and 6853 transitions. [2018-11-23 02:01:02,874 INFO L78 Accepts]: Start accepts. Automaton has 4800 states and 6853 transitions. Word has length 71 [2018-11-23 02:01:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:02,874 INFO L480 AbstractCegarLoop]: Abstraction has 4800 states and 6853 transitions. [2018-11-23 02:01:02,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:01:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4800 states and 6853 transitions. [2018-11-23 02:01:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 02:01:02,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:02,876 INFO L402 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] [2018-11-23 02:01:02,876 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:02,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1814336021, now seen corresponding path program 1 times [2018-11-23 02:01:02,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:02,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:02,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:02,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:02,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:03,061 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-23 02:01:03,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:03,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:01:03,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:01:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:01:03,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:01:03,062 INFO L87 Difference]: Start difference. First operand 4800 states and 6853 transitions. Second operand 7 states. [2018-11-23 02:01:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:05,480 INFO L93 Difference]: Finished difference Result 9183 states and 13213 transitions. [2018-11-23 02:01:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:01:05,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-11-23 02:01:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:05,490 INFO L225 Difference]: With dead ends: 9183 [2018-11-23 02:01:05,490 INFO L226 Difference]: Without dead ends: 4946 [2018-11-23 02:01:05,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2018-11-23 02:01:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4808. [2018-11-23 02:01:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4808 states. [2018-11-23 02:01:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 6861 transitions. [2018-11-23 02:01:05,764 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 6861 transitions. Word has length 72 [2018-11-23 02:01:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:05,764 INFO L480 AbstractCegarLoop]: Abstraction has 4808 states and 6861 transitions. [2018-11-23 02:01:05,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:01:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 6861 transitions. [2018-11-23 02:01:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 02:01:05,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:05,766 INFO L402 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] [2018-11-23 02:01:05,766 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:05,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:05,766 INFO L82 PathProgramCache]: Analyzing trace with hash -507451768, now seen corresponding path program 1 times [2018-11-23 02:01:05,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:05,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:05,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:05,888 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-23 02:01:05,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:05,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:01:05,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:01:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:01:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:01:05,889 INFO L87 Difference]: Start difference. First operand 4808 states and 6861 transitions. Second operand 5 states. [2018-11-23 02:01:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:08,189 INFO L93 Difference]: Finished difference Result 9160 states and 13219 transitions. [2018-11-23 02:01:08,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:01:08,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-23 02:01:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:08,201 INFO L225 Difference]: With dead ends: 9160 [2018-11-23 02:01:08,201 INFO L226 Difference]: Without dead ends: 4928 [2018-11-23 02:01:08,207 INFO L631 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-23 02:01:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2018-11-23 02:01:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4816. [2018-11-23 02:01:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4816 states. [2018-11-23 02:01:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 6869 transitions. [2018-11-23 02:01:08,386 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 6869 transitions. Word has length 73 [2018-11-23 02:01:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:08,386 INFO L480 AbstractCegarLoop]: Abstraction has 4816 states and 6869 transitions. [2018-11-23 02:01:08,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:01:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 6869 transitions. [2018-11-23 02:01:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 02:01:08,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:08,388 INFO L402 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] [2018-11-23 02:01:08,388 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:08,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2052051640, now seen corresponding path program 1 times [2018-11-23 02:01:08,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:08,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:08,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:08,496 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-23 02:01:08,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:08,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:01:08,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:01:08,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:01:08,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:01:08,497 INFO L87 Difference]: Start difference. First operand 4816 states and 6869 transitions. Second operand 3 states. [2018-11-23 02:01:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:08,745 INFO L93 Difference]: Finished difference Result 8097 states and 11571 transitions. [2018-11-23 02:01:08,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:01:08,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-11-23 02:01:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:08,755 INFO L225 Difference]: With dead ends: 8097 [2018-11-23 02:01:08,755 INFO L226 Difference]: Without dead ends: 4787 [2018-11-23 02:01:08,760 INFO L631 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-23 02:01:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4787 states. [2018-11-23 02:01:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4787 to 4785. [2018-11-23 02:01:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4785 states. [2018-11-23 02:01:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 6816 transitions. [2018-11-23 02:01:08,938 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 6816 transitions. Word has length 84 [2018-11-23 02:01:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:08,938 INFO L480 AbstractCegarLoop]: Abstraction has 4785 states and 6816 transitions. [2018-11-23 02:01:08,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:01:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 6816 transitions. [2018-11-23 02:01:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 02:01:08,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:08,940 INFO L402 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] [2018-11-23 02:01:08,940 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:08,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1431568140, now seen corresponding path program 1 times [2018-11-23 02:01:08,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:08,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:08,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:08,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:09,092 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-23 02:01:09,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:09,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:01:09,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:01:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:01:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:01:09,094 INFO L87 Difference]: Start difference. First operand 4785 states and 6816 transitions. Second operand 6 states. [2018-11-23 02:01:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:09,331 INFO L93 Difference]: Finished difference Result 4816 states and 6858 transitions. [2018-11-23 02:01:09,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:01:09,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-23 02:01:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:09,342 INFO L225 Difference]: With dead ends: 4816 [2018-11-23 02:01:09,342 INFO L226 Difference]: Without dead ends: 4792 [2018-11-23 02:01:09,345 INFO L631 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-23 02:01:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2018-11-23 02:01:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4790. [2018-11-23 02:01:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2018-11-23 02:01:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 6825 transitions. [2018-11-23 02:01:09,509 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 6825 transitions. Word has length 74 [2018-11-23 02:01:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:09,509 INFO L480 AbstractCegarLoop]: Abstraction has 4790 states and 6825 transitions. [2018-11-23 02:01:09,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:01:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 6825 transitions. [2018-11-23 02:01:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 02:01:09,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:09,510 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 02:01:09,510 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:09,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash -313065878, now seen corresponding path program 1 times [2018-11-23 02:01:09,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:09,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:09,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:09,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:09,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 02:01:09,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:09,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:01:09,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:01:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:01:09,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:09,658 INFO L87 Difference]: Start difference. First operand 4790 states and 6825 transitions. Second operand 8 states. [2018-11-23 02:01:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:09,859 INFO L93 Difference]: Finished difference Result 4811 states and 6858 transitions. [2018-11-23 02:01:09,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:01:09,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-23 02:01:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:09,865 INFO L225 Difference]: With dead ends: 4811 [2018-11-23 02:01:09,865 INFO L226 Difference]: Without dead ends: 4795 [2018-11-23 02:01:09,867 INFO L631 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-23 02:01:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2018-11-23 02:01:10,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4787. [2018-11-23 02:01:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4787 states. [2018-11-23 02:01:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4787 states and 6820 transitions. [2018-11-23 02:01:10,114 INFO L78 Accepts]: Start accepts. Automaton has 4787 states and 6820 transitions. Word has length 78 [2018-11-23 02:01:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:10,114 INFO L480 AbstractCegarLoop]: Abstraction has 4787 states and 6820 transitions. [2018-11-23 02:01:10,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:01:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4787 states and 6820 transitions. [2018-11-23 02:01:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 02:01:10,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:10,116 INFO L402 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-23 02:01:10,116 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:10,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1329379783, now seen corresponding path program 1 times [2018-11-23 02:01:10,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:10,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:10,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:10,246 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-23 02:01:10,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:10,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:01:10,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:01:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:01:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:01:10,247 INFO L87 Difference]: Start difference. First operand 4787 states and 6820 transitions. Second operand 5 states. [2018-11-23 02:01:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:11,147 INFO L93 Difference]: Finished difference Result 9130 states and 13171 transitions. [2018-11-23 02:01:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:01:11,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-23 02:01:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:11,155 INFO L225 Difference]: With dead ends: 9130 [2018-11-23 02:01:11,155 INFO L226 Difference]: Without dead ends: 4871 [2018-11-23 02:01:11,161 INFO L631 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-23 02:01:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2018-11-23 02:01:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4843. [2018-11-23 02:01:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4843 states. [2018-11-23 02:01:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 6876 transitions. [2018-11-23 02:01:11,342 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 6876 transitions. Word has length 76 [2018-11-23 02:01:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:11,342 INFO L480 AbstractCegarLoop]: Abstraction has 4843 states and 6876 transitions. [2018-11-23 02:01:11,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:01:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 6876 transitions. [2018-11-23 02:01:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 02:01:11,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:11,344 INFO L402 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-23 02:01:11,344 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:11,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash -685789946, now seen corresponding path program 1 times [2018-11-23 02:01:11,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:11,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:11,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:11,452 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-23 02:01:11,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:11,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:01:11,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:01:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:01:11,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:01:11,453 INFO L87 Difference]: Start difference. First operand 4843 states and 6876 transitions. Second operand 5 states. [2018-11-23 02:01:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:11,646 INFO L93 Difference]: Finished difference Result 9664 states and 13727 transitions. [2018-11-23 02:01:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:01:11,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-23 02:01:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:11,656 INFO L225 Difference]: With dead ends: 9664 [2018-11-23 02:01:11,656 INFO L226 Difference]: Without dead ends: 4843 [2018-11-23 02:01:11,662 INFO L631 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-23 02:01:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2018-11-23 02:01:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4843. [2018-11-23 02:01:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4843 states. [2018-11-23 02:01:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 6875 transitions. [2018-11-23 02:01:11,843 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 6875 transitions. Word has length 76 [2018-11-23 02:01:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:11,843 INFO L480 AbstractCegarLoop]: Abstraction has 4843 states and 6875 transitions. [2018-11-23 02:01:11,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:01:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 6875 transitions. [2018-11-23 02:01:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 02:01:11,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:11,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:11,844 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:11,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash 268267439, now seen corresponding path program 1 times [2018-11-23 02:01:11,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:11,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:11,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:11,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:11,981 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-23 02:01:11,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:11,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:01:11,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:01:11,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:01:11,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:01:11,982 INFO L87 Difference]: Start difference. First operand 4843 states and 6875 transitions. Second operand 6 states. [2018-11-23 02:01:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:16,307 INFO L93 Difference]: Finished difference Result 9228 states and 13214 transitions. [2018-11-23 02:01:16,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:01:16,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-23 02:01:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:16,316 INFO L225 Difference]: With dead ends: 9228 [2018-11-23 02:01:16,316 INFO L226 Difference]: Without dead ends: 4932 [2018-11-23 02:01:16,323 INFO L631 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-23 02:01:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4932 states. [2018-11-23 02:01:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4932 to 4866. [2018-11-23 02:01:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4866 states. [2018-11-23 02:01:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4866 states to 4866 states and 6891 transitions. [2018-11-23 02:01:16,508 INFO L78 Accepts]: Start accepts. Automaton has 4866 states and 6891 transitions. Word has length 80 [2018-11-23 02:01:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:16,508 INFO L480 AbstractCegarLoop]: Abstraction has 4866 states and 6891 transitions. [2018-11-23 02:01:16,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:01:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4866 states and 6891 transitions. [2018-11-23 02:01:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 02:01:16,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:16,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:16,510 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:16,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1511514785, now seen corresponding path program 1 times [2018-11-23 02:01:16,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:16,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:16,669 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-23 02:01:16,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:16,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:01:16,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:01:16,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:01:16,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:16,670 INFO L87 Difference]: Start difference. First operand 4866 states and 6891 transitions. Second operand 9 states. [2018-11-23 02:01:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:17,141 INFO L93 Difference]: Finished difference Result 4885 states and 6912 transitions. [2018-11-23 02:01:17,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:01:17,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-23 02:01:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:17,148 INFO L225 Difference]: With dead ends: 4885 [2018-11-23 02:01:17,149 INFO L226 Difference]: Without dead ends: 4861 [2018-11-23 02:01:17,150 INFO L631 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-23 02:01:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2018-11-23 02:01:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 4861. [2018-11-23 02:01:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4861 states. [2018-11-23 02:01:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 6884 transitions. [2018-11-23 02:01:17,325 INFO L78 Accepts]: Start accepts. Automaton has 4861 states and 6884 transitions. Word has length 79 [2018-11-23 02:01:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:17,325 INFO L480 AbstractCegarLoop]: Abstraction has 4861 states and 6884 transitions. [2018-11-23 02:01:17,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:01:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4861 states and 6884 transitions. [2018-11-23 02:01:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 02:01:17,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:17,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:17,326 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:17,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1287323433, now seen corresponding path program 1 times [2018-11-23 02:01:17,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:17,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:17,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:17,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:17,468 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-23 02:01:17,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:17,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:01:17,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:01:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:01:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:17,469 INFO L87 Difference]: Start difference. First operand 4861 states and 6884 transitions. Second operand 9 states. [2018-11-23 02:01:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:18,036 INFO L93 Difference]: Finished difference Result 4880 states and 6905 transitions. [2018-11-23 02:01:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:01:18,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-23 02:01:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:18,043 INFO L225 Difference]: With dead ends: 4880 [2018-11-23 02:01:18,043 INFO L226 Difference]: Without dead ends: 4857 [2018-11-23 02:01:18,044 INFO L631 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-23 02:01:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2018-11-23 02:01:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 4857. [2018-11-23 02:01:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4857 states. [2018-11-23 02:01:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 6878 transitions. [2018-11-23 02:01:18,223 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 6878 transitions. Word has length 79 [2018-11-23 02:01:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:18,223 INFO L480 AbstractCegarLoop]: Abstraction has 4857 states and 6878 transitions. [2018-11-23 02:01:18,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:01:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 6878 transitions. [2018-11-23 02:01:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 02:01:18,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:18,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:18,224 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:18,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:18,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1488041553, now seen corresponding path program 1 times [2018-11-23 02:01:18,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:18,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:18,374 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-23 02:01:18,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:18,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:01:18,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:01:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:01:18,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:18,375 INFO L87 Difference]: Start difference. First operand 4857 states and 6878 transitions. Second operand 9 states. [2018-11-23 02:01:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:18,869 INFO L93 Difference]: Finished difference Result 4876 states and 6899 transitions. [2018-11-23 02:01:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:01:18,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-11-23 02:01:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:18,877 INFO L225 Difference]: With dead ends: 4876 [2018-11-23 02:01:18,877 INFO L226 Difference]: Without dead ends: 4853 [2018-11-23 02:01:18,878 INFO L631 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-23 02:01:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4853 states. [2018-11-23 02:01:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4853 to 4853. [2018-11-23 02:01:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4853 states. [2018-11-23 02:01:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6872 transitions. [2018-11-23 02:01:19,062 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6872 transitions. Word has length 80 [2018-11-23 02:01:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:19,062 INFO L480 AbstractCegarLoop]: Abstraction has 4853 states and 6872 transitions. [2018-11-23 02:01:19,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:01:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6872 transitions. [2018-11-23 02:01:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 02:01:19,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:19,063 INFO L402 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-23 02:01:19,063 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:19,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1703445391, now seen corresponding path program 1 times [2018-11-23 02:01:19,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:19,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:19,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:19,187 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-23 02:01:19,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:19,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:01:19,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:01:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:01:19,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:19,188 INFO L87 Difference]: Start difference. First operand 4853 states and 6872 transitions. Second operand 8 states. [2018-11-23 02:01:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:19,623 INFO L93 Difference]: Finished difference Result 4872 states and 6903 transitions. [2018-11-23 02:01:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:01:19,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-11-23 02:01:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:19,631 INFO L225 Difference]: With dead ends: 4872 [2018-11-23 02:01:19,631 INFO L226 Difference]: Without dead ends: 4858 [2018-11-23 02:01:19,633 INFO L631 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-23 02:01:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4858 states. [2018-11-23 02:01:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4858 to 4850. [2018-11-23 02:01:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4850 states. [2018-11-23 02:01:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 6867 transitions. [2018-11-23 02:01:19,806 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 6867 transitions. Word has length 81 [2018-11-23 02:01:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:19,807 INFO L480 AbstractCegarLoop]: Abstraction has 4850 states and 6867 transitions. [2018-11-23 02:01:19,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:01:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 6867 transitions. [2018-11-23 02:01:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 02:01:19,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:19,808 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 02:01:19,808 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:19,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash -466652247, now seen corresponding path program 1 times [2018-11-23 02:01:19,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:19,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:19,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:19,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:01:19,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:19,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/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-23 02:01:19,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:20,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:01:20,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:01:20,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-23 02:01:20,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:01:20,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:01:20,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:20,439 INFO L87 Difference]: Start difference. First operand 4850 states and 6867 transitions. Second operand 8 states. [2018-11-23 02:01:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:32,050 INFO L93 Difference]: Finished difference Result 9618 states and 13859 transitions. [2018-11-23 02:01:32,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:01:32,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-11-23 02:01:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:32,067 INFO L225 Difference]: With dead ends: 9618 [2018-11-23 02:01:32,067 INFO L226 Difference]: Without dead ends: 5317 [2018-11-23 02:01:32,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:01:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2018-11-23 02:01:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 4882. [2018-11-23 02:01:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4882 states. [2018-11-23 02:01:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 6899 transitions. [2018-11-23 02:01:32,336 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 6899 transitions. Word has length 85 [2018-11-23 02:01:32,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:32,336 INFO L480 AbstractCegarLoop]: Abstraction has 4882 states and 6899 transitions. [2018-11-23 02:01:32,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:01:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 6899 transitions. [2018-11-23 02:01:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 02:01:32,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:32,340 INFO L402 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-23 02:01:32,340 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:32,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:32,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1934004497, now seen corresponding path program 1 times [2018-11-23 02:01:32,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:32,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:32,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:32,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:32,525 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-23 02:01:32,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:32,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:01:32,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:01:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:01:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:01:32,526 INFO L87 Difference]: Start difference. First operand 4882 states and 6899 transitions. Second operand 6 states. [2018-11-23 02:01:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:34,879 INFO L93 Difference]: Finished difference Result 8301 states and 11779 transitions. [2018-11-23 02:01:34,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:01:34,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-11-23 02:01:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:34,893 INFO L225 Difference]: With dead ends: 8301 [2018-11-23 02:01:34,893 INFO L226 Difference]: Without dead ends: 4936 [2018-11-23 02:01:34,899 INFO L631 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-23 02:01:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4936 states. [2018-11-23 02:01:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4936 to 4899. [2018-11-23 02:01:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4899 states. [2018-11-23 02:01:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 6925 transitions. [2018-11-23 02:01:35,256 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 6925 transitions. Word has length 88 [2018-11-23 02:01:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:35,256 INFO L480 AbstractCegarLoop]: Abstraction has 4899 states and 6925 transitions. [2018-11-23 02:01:35,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:01:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 6925 transitions. [2018-11-23 02:01:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 02:01:35,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:35,259 INFO L402 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] [2018-11-23 02:01:35,259 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:35,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:35,259 INFO L82 PathProgramCache]: Analyzing trace with hash 397798265, now seen corresponding path program 1 times [2018-11-23 02:01:35,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:35,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:35,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:35,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:35,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:35,399 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-23 02:01:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:01:35,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:01:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:01:35,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:01:35,401 INFO L87 Difference]: Start difference. First operand 4899 states and 6925 transitions. Second operand 6 states. [2018-11-23 02:01:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:35,674 INFO L93 Difference]: Finished difference Result 7364 states and 10426 transitions. [2018-11-23 02:01:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:01:35,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-23 02:01:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:35,684 INFO L225 Difference]: With dead ends: 7364 [2018-11-23 02:01:35,684 INFO L226 Difference]: Without dead ends: 4940 [2018-11-23 02:01:35,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-11-23 02:01:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4903. [2018-11-23 02:01:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4903 states. [2018-11-23 02:01:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 6929 transitions. [2018-11-23 02:01:35,891 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 6929 transitions. Word has length 93 [2018-11-23 02:01:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:35,891 INFO L480 AbstractCegarLoop]: Abstraction has 4903 states and 6929 transitions. [2018-11-23 02:01:35,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:01:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 6929 transitions. [2018-11-23 02:01:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 02:01:35,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:35,893 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 02:01:35,894 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:35,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:35,894 INFO L82 PathProgramCache]: Analyzing trace with hash -744177600, now seen corresponding path program 1 times [2018-11-23 02:01:35,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:35,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:35,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:35,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:35,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:01:36,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:36,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/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-23 02:01:36,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:36,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:01:36,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:01:36,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2018-11-23 02:01:36,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:01:36,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:01:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:01:36,725 INFO L87 Difference]: Start difference. First operand 4903 states and 6929 transitions. Second operand 14 states. [2018-11-23 02:02:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:12,926 INFO L93 Difference]: Finished difference Result 6183 states and 8585 transitions. [2018-11-23 02:02:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:02:12,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-11-23 02:02:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:12,930 INFO L225 Difference]: With dead ends: 6183 [2018-11-23 02:02:12,930 INFO L226 Difference]: Without dead ends: 1039 [2018-11-23 02:02:12,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:02:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-11-23 02:02:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 929. [2018-11-23 02:02:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-11-23 02:02:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1133 transitions. [2018-11-23 02:02:12,993 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1133 transitions. Word has length 86 [2018-11-23 02:02:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:12,993 INFO L480 AbstractCegarLoop]: Abstraction has 929 states and 1133 transitions. [2018-11-23 02:02:12,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:02:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1133 transitions. [2018-11-23 02:02:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 02:02:12,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:12,994 INFO L402 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] [2018-11-23 02:02:12,995 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:12,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 639811783, now seen corresponding path program 1 times [2018-11-23 02:02:12,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:13,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:13,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:13,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:13,161 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-23 02:02:13,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:13,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:13,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:13,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:13,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:13,162 INFO L87 Difference]: Start difference. First operand 929 states and 1133 transitions. Second operand 5 states. [2018-11-23 02:02:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:13,874 INFO L93 Difference]: Finished difference Result 1875 states and 2392 transitions. [2018-11-23 02:02:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:02:13,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-23 02:02:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:13,879 INFO L225 Difference]: With dead ends: 1875 [2018-11-23 02:02:13,879 INFO L226 Difference]: Without dead ends: 1358 [2018-11-23 02:02:13,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:02:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2018-11-23 02:02:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1132. [2018-11-23 02:02:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-11-23 02:02:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1413 transitions. [2018-11-23 02:02:13,984 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1413 transitions. Word has length 89 [2018-11-23 02:02:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:13,984 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1413 transitions. [2018-11-23 02:02:13,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1413 transitions. [2018-11-23 02:02:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 02:02:13,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:13,986 INFO L402 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] [2018-11-23 02:02:13,986 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:13,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:13,986 INFO L82 PathProgramCache]: Analyzing trace with hash 204254985, now seen corresponding path program 1 times [2018-11-23 02:02:13,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:13,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:13,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:14,107 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-23 02:02:14,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:02:14,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:02:14,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:02:14,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:02:14,109 INFO L87 Difference]: Start difference. First operand 1132 states and 1413 transitions. Second operand 3 states. [2018-11-23 02:02:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:14,196 INFO L93 Difference]: Finished difference Result 1869 states and 2382 transitions. [2018-11-23 02:02:14,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:02:14,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-11-23 02:02:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:14,200 INFO L225 Difference]: With dead ends: 1869 [2018-11-23 02:02:14,200 INFO L226 Difference]: Without dead ends: 1165 [2018-11-23 02:02:14,202 INFO L631 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-23 02:02:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2018-11-23 02:02:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1136. [2018-11-23 02:02:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2018-11-23 02:02:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1419 transitions. [2018-11-23 02:02:14,291 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1419 transitions. Word has length 95 [2018-11-23 02:02:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:14,292 INFO L480 AbstractCegarLoop]: Abstraction has 1136 states and 1419 transitions. [2018-11-23 02:02:14,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:02:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1419 transitions. [2018-11-23 02:02:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 02:02:14,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:14,294 INFO L402 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] [2018-11-23 02:02:14,294 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:14,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:14,294 INFO L82 PathProgramCache]: Analyzing trace with hash 916729673, now seen corresponding path program 1 times [2018-11-23 02:02:14,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:14,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:14,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:14,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:14,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:14,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-23 02:02:14,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:14,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:02:14,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:02:14,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:02:14,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:02:14,538 INFO L87 Difference]: Start difference. First operand 1136 states and 1419 transitions. Second operand 3 states. [2018-11-23 02:02:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:14,723 INFO L93 Difference]: Finished difference Result 1963 states and 2489 transitions. [2018-11-23 02:02:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:02:14,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-11-23 02:02:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:14,728 INFO L225 Difference]: With dead ends: 1963 [2018-11-23 02:02:14,728 INFO L226 Difference]: Without dead ends: 1277 [2018-11-23 02:02:14,729 INFO L631 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-23 02:02:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-11-23 02:02:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1242. [2018-11-23 02:02:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-11-23 02:02:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1559 transitions. [2018-11-23 02:02:14,808 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1559 transitions. Word has length 95 [2018-11-23 02:02:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:14,808 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 1559 transitions. [2018-11-23 02:02:14,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:02:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1559 transitions. [2018-11-23 02:02:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 02:02:14,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:14,810 INFO L402 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] [2018-11-23 02:02:14,810 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:14,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1660691633, now seen corresponding path program 1 times [2018-11-23 02:02:14,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:14,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:14,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:14,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:14,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:14,982 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-23 02:02:14,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:14,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:02:14,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:02:14,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:02:14,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:02:14,983 INFO L87 Difference]: Start difference. First operand 1242 states and 1559 transitions. Second operand 6 states. [2018-11-23 02:02:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:19,103 INFO L93 Difference]: Finished difference Result 1272 states and 1593 transitions. [2018-11-23 02:02:19,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:02:19,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-11-23 02:02:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:19,106 INFO L225 Difference]: With dead ends: 1272 [2018-11-23 02:02:19,106 INFO L226 Difference]: Without dead ends: 1197 [2018-11-23 02:02:19,106 INFO L631 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-23 02:02:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-23 02:02:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2018-11-23 02:02:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2018-11-23 02:02:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1508 transitions. [2018-11-23 02:02:19,174 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1508 transitions. Word has length 90 [2018-11-23 02:02:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:19,174 INFO L480 AbstractCegarLoop]: Abstraction has 1197 states and 1508 transitions. [2018-11-23 02:02:19,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:02:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1508 transitions. [2018-11-23 02:02:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 02:02:19,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:19,176 INFO L402 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] [2018-11-23 02:02:19,176 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:19,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash 700057661, now seen corresponding path program 1 times [2018-11-23 02:02:19,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:19,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:19,359 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-23 02:02:19,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:19,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:19,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:19,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:19,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:19,360 INFO L87 Difference]: Start difference. First operand 1197 states and 1508 transitions. Second operand 5 states. [2018-11-23 02:02:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:19,430 INFO L93 Difference]: Finished difference Result 1780 states and 2263 transitions. [2018-11-23 02:02:19,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:02:19,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-11-23 02:02:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:19,435 INFO L225 Difference]: With dead ends: 1780 [2018-11-23 02:02:19,435 INFO L226 Difference]: Without dead ends: 992 [2018-11-23 02:02:19,436 INFO L631 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-23 02:02:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-23 02:02:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-23 02:02:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-23 02:02:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1231 transitions. [2018-11-23 02:02:19,530 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1231 transitions. Word has length 103 [2018-11-23 02:02:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:19,531 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1231 transitions. [2018-11-23 02:02:19,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1231 transitions. [2018-11-23 02:02:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 02:02:19,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:19,532 INFO L402 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, 1, 1, 1] [2018-11-23 02:02:19,532 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:19,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash 186981750, now seen corresponding path program 1 times [2018-11-23 02:02:19,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:19,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:19,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:19,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:19,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:02:19,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:19,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:19,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:19,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:19,689 INFO L87 Difference]: Start difference. First operand 992 states and 1231 transitions. Second operand 5 states. [2018-11-23 02:02:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:20,126 INFO L93 Difference]: Finished difference Result 1449 states and 1800 transitions. [2018-11-23 02:02:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:02:20,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-23 02:02:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:20,129 INFO L225 Difference]: With dead ends: 1449 [2018-11-23 02:02:20,129 INFO L226 Difference]: Without dead ends: 870 [2018-11-23 02:02:20,130 INFO L631 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-23 02:02:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-11-23 02:02:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2018-11-23 02:02:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-23 02:02:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1059 transitions. [2018-11-23 02:02:20,180 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1059 transitions. Word has length 107 [2018-11-23 02:02:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:20,180 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1059 transitions. [2018-11-23 02:02:20,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1059 transitions. [2018-11-23 02:02:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 02:02:20,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:20,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:20,181 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:20,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:20,182 INFO L82 PathProgramCache]: Analyzing trace with hash -865462585, now seen corresponding path program 1 times [2018-11-23 02:02:20,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:20,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:20,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:20,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:20,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:20,302 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-23 02:02:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:20,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:20,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:20,303 INFO L87 Difference]: Start difference. First operand 870 states and 1059 transitions. Second operand 5 states. [2018-11-23 02:02:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:20,398 INFO L93 Difference]: Finished difference Result 905 states and 1095 transitions. [2018-11-23 02:02:20,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:02:20,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-23 02:02:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:20,400 INFO L225 Difference]: With dead ends: 905 [2018-11-23 02:02:20,400 INFO L226 Difference]: Without dead ends: 849 [2018-11-23 02:02:20,400 INFO L631 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-23 02:02:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-23 02:02:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2018-11-23 02:02:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-23 02:02:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1033 transitions. [2018-11-23 02:02:20,462 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1033 transitions. Word has length 96 [2018-11-23 02:02:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:20,462 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1033 transitions. [2018-11-23 02:02:20,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1033 transitions. [2018-11-23 02:02:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 02:02:20,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:20,464 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:20,464 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:20,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1992672997, now seen corresponding path program 1 times [2018-11-23 02:02:20,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:20,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:20,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:20,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:20,637 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-23 02:02:20,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:20,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:02:20,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:02:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:02:20,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:02:20,638 INFO L87 Difference]: Start difference. First operand 849 states and 1033 transitions. Second operand 6 states. [2018-11-23 02:02:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:20,733 INFO L93 Difference]: Finished difference Result 1303 states and 1592 transitions. [2018-11-23 02:02:20,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:02:20,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-11-23 02:02:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:20,736 INFO L225 Difference]: With dead ends: 1303 [2018-11-23 02:02:20,736 INFO L226 Difference]: Without dead ends: 857 [2018-11-23 02:02:20,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:02:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-11-23 02:02:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 845. [2018-11-23 02:02:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-11-23 02:02:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1026 transitions. [2018-11-23 02:02:20,817 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1026 transitions. Word has length 110 [2018-11-23 02:02:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:20,817 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1026 transitions. [2018-11-23 02:02:20,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:02:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1026 transitions. [2018-11-23 02:02:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 02:02:20,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:20,819 INFO L402 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-23 02:02:20,819 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:20,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1636212183, now seen corresponding path program 1 times [2018-11-23 02:02:20,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:20,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:20,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:20,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:20,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:20,982 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-23 02:02:20,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:20,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:02:20,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:02:20,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:02:20,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:02:20,984 INFO L87 Difference]: Start difference. First operand 845 states and 1026 transitions. Second operand 9 states. [2018-11-23 02:02:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:21,374 INFO L93 Difference]: Finished difference Result 862 states and 1044 transitions. [2018-11-23 02:02:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:02:21,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-11-23 02:02:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:21,377 INFO L225 Difference]: With dead ends: 862 [2018-11-23 02:02:21,377 INFO L226 Difference]: Without dead ends: 788 [2018-11-23 02:02:21,378 INFO L631 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-23 02:02:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-11-23 02:02:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2018-11-23 02:02:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-11-23 02:02:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 962 transitions. [2018-11-23 02:02:21,422 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 962 transitions. Word has length 99 [2018-11-23 02:02:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:21,423 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 962 transitions. [2018-11-23 02:02:21,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:02:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 962 transitions. [2018-11-23 02:02:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 02:02:21,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:21,425 INFO L402 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, 1, 1, 1, 1] [2018-11-23 02:02:21,425 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:21,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1349507873, now seen corresponding path program 1 times [2018-11-23 02:02:21,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:21,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:21,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:21,591 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-23 02:02:21,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:21,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:02:21,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:02:21,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:02:21,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:02:21,593 INFO L87 Difference]: Start difference. First operand 788 states and 962 transitions. Second operand 6 states. [2018-11-23 02:02:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:23,722 INFO L93 Difference]: Finished difference Result 1211 states and 1471 transitions. [2018-11-23 02:02:23,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:02:23,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-11-23 02:02:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:23,725 INFO L225 Difference]: With dead ends: 1211 [2018-11-23 02:02:23,725 INFO L226 Difference]: Without dead ends: 780 [2018-11-23 02:02:23,726 INFO L631 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-23 02:02:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-11-23 02:02:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 774. [2018-11-23 02:02:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2018-11-23 02:02:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 941 transitions. [2018-11-23 02:02:23,775 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 941 transitions. Word has length 108 [2018-11-23 02:02:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:23,775 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 941 transitions. [2018-11-23 02:02:23,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:02:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 941 transitions. [2018-11-23 02:02:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-23 02:02:23,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:23,776 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:23,777 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:23,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1564851664, now seen corresponding path program 1 times [2018-11-23 02:02:23,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:23,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:23,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:23,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:23,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:23,902 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-23 02:02:23,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:23,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:23,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:23,903 INFO L87 Difference]: Start difference. First operand 774 states and 941 transitions. Second operand 5 states. [2018-11-23 02:02:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:35,140 INFO L93 Difference]: Finished difference Result 1140 states and 1387 transitions. [2018-11-23 02:02:35,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:02:35,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-11-23 02:02:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:35,142 INFO L225 Difference]: With dead ends: 1140 [2018-11-23 02:02:35,142 INFO L226 Difference]: Without dead ends: 667 [2018-11-23 02:02:35,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:02:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-23 02:02:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 651. [2018-11-23 02:02:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-23 02:02:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 777 transitions. [2018-11-23 02:02:35,180 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 777 transitions. Word has length 120 [2018-11-23 02:02:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:35,180 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 777 transitions. [2018-11-23 02:02:35,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 777 transitions. [2018-11-23 02:02:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 02:02:35,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:35,181 INFO L402 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, 1, 1, 1, 1, 1] [2018-11-23 02:02:35,181 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:35,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1495371623, now seen corresponding path program 1 times [2018-11-23 02:02:35,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:35,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:35,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:35,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-23 02:02:35,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:35,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:35,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:35,307 INFO L87 Difference]: Start difference. First operand 651 states and 777 transitions. Second operand 5 states. [2018-11-23 02:02:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:45,533 INFO L93 Difference]: Finished difference Result 1230 states and 1453 transitions. [2018-11-23 02:02:45,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:02:45,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-11-23 02:02:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:45,536 INFO L225 Difference]: With dead ends: 1230 [2018-11-23 02:02:45,536 INFO L226 Difference]: Without dead ends: 835 [2018-11-23 02:02:45,536 INFO L631 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-23 02:02:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-23 02:02:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 801. [2018-11-23 02:02:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-23 02:02:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 944 transitions. [2018-11-23 02:02:45,625 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 944 transitions. Word has length 109 [2018-11-23 02:02:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:45,625 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 944 transitions. [2018-11-23 02:02:45,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 944 transitions. [2018-11-23 02:02:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 02:02:45,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:45,627 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:45,627 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:45,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:45,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1797060103, now seen corresponding path program 1 times [2018-11-23 02:02:45,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:45,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:45,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:45,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:45,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:45,781 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-23 02:02:45,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:45,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:02:45,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:02:45,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:02:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:02:45,782 INFO L87 Difference]: Start difference. First operand 801 states and 944 transitions. Second operand 9 states. [2018-11-23 02:02:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:46,136 INFO L93 Difference]: Finished difference Result 807 states and 949 transitions. [2018-11-23 02:02:46,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:02:46,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-11-23 02:02:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:46,139 INFO L225 Difference]: With dead ends: 807 [2018-11-23 02:02:46,139 INFO L226 Difference]: Without dead ends: 709 [2018-11-23 02:02:46,139 INFO L631 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-23 02:02:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-11-23 02:02:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2018-11-23 02:02:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-11-23 02:02:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 837 transitions. [2018-11-23 02:02:46,184 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 837 transitions. Word has length 110 [2018-11-23 02:02:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:46,184 INFO L480 AbstractCegarLoop]: Abstraction has 709 states and 837 transitions. [2018-11-23 02:02:46,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:02:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 837 transitions. [2018-11-23 02:02:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 02:02:46,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:46,186 INFO L402 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, 1, 1, 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-23 02:02:46,186 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:46,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:46,187 INFO L82 PathProgramCache]: Analyzing trace with hash 795808557, now seen corresponding path program 1 times [2018-11-23 02:02:46,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:46,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:46,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:46,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:46,394 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-23 02:02:46,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:46,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:02:46,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:02:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:02:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:02:46,395 INFO L87 Difference]: Start difference. First operand 709 states and 837 transitions. Second operand 9 states. [2018-11-23 02:02:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:48,638 INFO L93 Difference]: Finished difference Result 808 states and 978 transitions. [2018-11-23 02:02:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:02:48,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2018-11-23 02:02:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:48,640 INFO L225 Difference]: With dead ends: 808 [2018-11-23 02:02:48,640 INFO L226 Difference]: Without dead ends: 747 [2018-11-23 02:02:48,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:02:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-11-23 02:02:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 729. [2018-11-23 02:02:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-11-23 02:02:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 858 transitions. [2018-11-23 02:02:48,687 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 858 transitions. Word has length 130 [2018-11-23 02:02:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:48,687 INFO L480 AbstractCegarLoop]: Abstraction has 729 states and 858 transitions. [2018-11-23 02:02:48,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:02:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 858 transitions. [2018-11-23 02:02:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-23 02:02:48,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:48,688 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:02:48,688 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:48,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1272791197, now seen corresponding path program 1 times [2018-11-23 02:02:48,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:48,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:48,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:48,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:48,867 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-23 02:02:48,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:48,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:02:48,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:02:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:02:48,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:02:48,869 INFO L87 Difference]: Start difference. First operand 729 states and 858 transitions. Second operand 7 states. [2018-11-23 02:02:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:49,116 INFO L93 Difference]: Finished difference Result 1380 states and 1626 transitions. [2018-11-23 02:02:49,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:02:49,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2018-11-23 02:02:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:49,119 INFO L225 Difference]: With dead ends: 1380 [2018-11-23 02:02:49,119 INFO L226 Difference]: Without dead ends: 1299 [2018-11-23 02:02:49,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:02:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2018-11-23 02:02:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 602. [2018-11-23 02:02:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-23 02:02:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 702 transitions. [2018-11-23 02:02:49,167 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 702 transitions. Word has length 138 [2018-11-23 02:02:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:49,167 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 702 transitions. [2018-11-23 02:02:49,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:02:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 702 transitions. [2018-11-23 02:02:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 02:02:49,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:49,168 INFO L402 BasicCegarLoop]: trace histogram [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-23 02:02:49,168 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:49,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:49,168 INFO L82 PathProgramCache]: Analyzing trace with hash 7313043, now seen corresponding path program 1 times [2018-11-23 02:02:49,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:49,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:49,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:49,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 02:02:49,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:49,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:49,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:49,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:49,290 INFO L87 Difference]: Start difference. First operand 602 states and 702 transitions. Second operand 5 states. [2018-11-23 02:02:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:51,352 INFO L93 Difference]: Finished difference Result 646 states and 753 transitions. [2018-11-23 02:02:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:02:51,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-23 02:02:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:51,353 INFO L225 Difference]: With dead ends: 646 [2018-11-23 02:02:51,353 INFO L226 Difference]: Without dead ends: 601 [2018-11-23 02:02:51,354 INFO L631 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-23 02:02:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-23 02:02:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-11-23 02:02:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-23 02:02:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 700 transitions. [2018-11-23 02:02:51,398 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 700 transitions. Word has length 132 [2018-11-23 02:02:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:51,398 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 700 transitions. [2018-11-23 02:02:51,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 700 transitions. [2018-11-23 02:02:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 02:02:51,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:51,399 INFO L402 BasicCegarLoop]: trace histogram [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-23 02:02:51,399 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:51,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1804195858, now seen corresponding path program 1 times [2018-11-23 02:02:51,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:51,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:51,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 02:02:51,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:51,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:51,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:51,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:51,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:51,518 INFO L87 Difference]: Start difference. First operand 601 states and 700 transitions. Second operand 5 states. [2018-11-23 02:02:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:53,573 INFO L93 Difference]: Finished difference Result 611 states and 708 transitions. [2018-11-23 02:02:53,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:02:53,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-23 02:02:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:53,575 INFO L225 Difference]: With dead ends: 611 [2018-11-23 02:02:53,575 INFO L226 Difference]: Without dead ends: 501 [2018-11-23 02:02:53,575 INFO L631 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-23 02:02:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-11-23 02:02:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2018-11-23 02:02:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-11-23 02:02:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 587 transitions. [2018-11-23 02:02:53,615 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 587 transitions. Word has length 132 [2018-11-23 02:02:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:53,615 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 587 transitions. [2018-11-23 02:02:53,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 587 transitions. [2018-11-23 02:02:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 02:02:53,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:53,616 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 02:02:53,616 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:53,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash 232663310, now seen corresponding path program 1 times [2018-11-23 02:02:53,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:53,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:53,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:02:53,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:53,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:02:53,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:02:53,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:02:53,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:02:53,775 INFO L87 Difference]: Start difference. First operand 501 states and 587 transitions. Second operand 6 states. [2018-11-23 02:02:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:53,835 INFO L93 Difference]: Finished difference Result 531 states and 616 transitions. [2018-11-23 02:02:53,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:02:53,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-11-23 02:02:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:53,837 INFO L225 Difference]: With dead ends: 531 [2018-11-23 02:02:53,837 INFO L226 Difference]: Without dead ends: 409 [2018-11-23 02:02:53,837 INFO L631 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-23 02:02:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-23 02:02:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 305. [2018-11-23 02:02:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 02:02:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 339 transitions. [2018-11-23 02:02:53,861 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 339 transitions. Word has length 137 [2018-11-23 02:02:53,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:53,861 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 339 transitions. [2018-11-23 02:02:53,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:02:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 339 transitions. [2018-11-23 02:02:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 02:02:53,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:53,862 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:02:53,862 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:53,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1638697690, now seen corresponding path program 1 times [2018-11-23 02:02:53,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:53,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:53,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:53,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:53,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:54,001 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-23 02:02:54,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:54,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:02:54,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:02:54,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:02:54,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:02:54,002 INFO L87 Difference]: Start difference. First operand 305 states and 339 transitions. Second operand 3 states. [2018-11-23 02:02:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:56,066 INFO L93 Difference]: Finished difference Result 390 states and 436 transitions. [2018-11-23 02:02:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:02:56,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-11-23 02:02:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:56,068 INFO L225 Difference]: With dead ends: 390 [2018-11-23 02:02:56,068 INFO L226 Difference]: Without dead ends: 324 [2018-11-23 02:02:56,068 INFO L631 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-23 02:02:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-23 02:02:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 303. [2018-11-23 02:02:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 02:02:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 336 transitions. [2018-11-23 02:02:56,094 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 336 transitions. Word has length 159 [2018-11-23 02:02:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:56,094 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 336 transitions. [2018-11-23 02:02:56,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:02:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 336 transitions. [2018-11-23 02:02:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-23 02:02:56,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:56,095 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:02:56,095 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:56,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2044258711, now seen corresponding path program 1 times [2018-11-23 02:02:56,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:56,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:56,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:56,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:56,261 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-23 02:02:56,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:56,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:56,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:56,262 INFO L87 Difference]: Start difference. First operand 303 states and 336 transitions. Second operand 5 states. [2018-11-23 02:02:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:58,334 INFO L93 Difference]: Finished difference Result 355 states and 390 transitions. [2018-11-23 02:02:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:02:58,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-11-23 02:02:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:58,336 INFO L225 Difference]: With dead ends: 355 [2018-11-23 02:02:58,336 INFO L226 Difference]: Without dead ends: 309 [2018-11-23 02:02:58,337 INFO L631 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-23 02:02:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-23 02:02:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2018-11-23 02:02:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-23 02:02:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 340 transitions. [2018-11-23 02:02:58,361 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 340 transitions. Word has length 162 [2018-11-23 02:02:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:58,361 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 340 transitions. [2018-11-23 02:02:58,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:02:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 340 transitions. [2018-11-23 02:02:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-23 02:02:58,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:58,362 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:02:58,362 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:58,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:58,362 INFO L82 PathProgramCache]: Analyzing trace with hash 507823032, now seen corresponding path program 1 times [2018-11-23 02:02:58,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:58,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:58,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:58,518 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-23 02:02:58,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:58,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:02:58,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:02:58,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:02:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:02:58,519 INFO L87 Difference]: Start difference. First operand 307 states and 340 transitions. Second operand 5 states. [2018-11-23 02:03:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:03:00,591 INFO L93 Difference]: Finished difference Result 417 states and 466 transitions. [2018-11-23 02:03:00,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:03:00,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-11-23 02:03:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:03:00,593 INFO L225 Difference]: With dead ends: 417 [2018-11-23 02:03:00,593 INFO L226 Difference]: Without dead ends: 307 [2018-11-23 02:03:00,593 INFO L631 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-23 02:03:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-23 02:03:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-23 02:03:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-23 02:03:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 339 transitions. [2018-11-23 02:03:00,616 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 339 transitions. Word has length 162 [2018-11-23 02:03:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:03:00,617 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 339 transitions. [2018-11-23 02:03:00,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:03:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 339 transitions. [2018-11-23 02:03:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-23 02:03:00,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:03:00,617 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:03:00,618 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:03:00,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:03:00,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1957298653, now seen corresponding path program 1 times [2018-11-23 02:03:00,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:03:00,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:03:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:03:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:03:00,867 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-23 02:03:00,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:03:00,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 02:03:00,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:03:00,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:03:00,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:03:00,868 INFO L87 Difference]: Start difference. First operand 307 states and 339 transitions. Second operand 11 states. [2018-11-23 02:03:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:03:05,093 INFO L93 Difference]: Finished difference Result 358 states and 401 transitions. [2018-11-23 02:03:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:03:05,093 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 191 [2018-11-23 02:03:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:03:05,094 INFO L225 Difference]: With dead ends: 358 [2018-11-23 02:03:05,094 INFO L226 Difference]: Without dead ends: 315 [2018-11-23 02:03:05,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:03:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-23 02:03:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2018-11-23 02:03:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-23 02:03:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 338 transitions. [2018-11-23 02:03:05,113 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 338 transitions. Word has length 191 [2018-11-23 02:03:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:03:05,113 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 338 transitions. [2018-11-23 02:03:05,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:03:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 338 transitions. [2018-11-23 02:03:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-23 02:03:05,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:03:05,114 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:03:05,114 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:03:05,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:03:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash 30874619, now seen corresponding path program 1 times [2018-11-23 02:03:05,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:03:05,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:03:05,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:05,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:03:05,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:03:07,141 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-23 02:03:07,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:03:07,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/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-23 02:03:07,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:03:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:03:07,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:03:07,581 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-23 02:03:07,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:03:07,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-23 02:03:07,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:03:07,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:03:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:03:07,600 INFO L87 Difference]: Start difference. First operand 307 states and 338 transitions. Second operand 14 states. [2018-11-23 02:03:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:03:10,142 INFO L93 Difference]: Finished difference Result 613 states and 683 transitions. [2018-11-23 02:03:10,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 02:03:10,142 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 194 [2018-11-23 02:03:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:03:10,143 INFO L225 Difference]: With dead ends: 613 [2018-11-23 02:03:10,143 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 02:03:10,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:03:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 02:03:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 289. [2018-11-23 02:03:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-23 02:03:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 313 transitions. [2018-11-23 02:03:10,169 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 313 transitions. Word has length 194 [2018-11-23 02:03:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:03:10,169 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 313 transitions. [2018-11-23 02:03:10,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:03:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 313 transitions. [2018-11-23 02:03:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-23 02:03:10,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:03:10,171 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:03:10,171 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:03:10,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:03:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1033134638, now seen corresponding path program 1 times [2018-11-23 02:03:10,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:03:10,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:03:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:03:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:03:10,479 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-23 02:03:10,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:03:10,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:03:10,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:03:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:03:10,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:03:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 02:03:10,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:03:10,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 02:03:10,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 02:03:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 02:03:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:03:10,982 INFO L87 Difference]: Start difference. First operand 289 states and 313 transitions. Second operand 15 states. [2018-11-23 02:03:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:03:13,532 INFO L93 Difference]: Finished difference Result 581 states and 639 transitions. [2018-11-23 02:03:13,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 02:03:13,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 198 [2018-11-23 02:03:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:03:13,533 INFO L225 Difference]: With dead ends: 581 [2018-11-23 02:03:13,533 INFO L226 Difference]: Without dead ends: 309 [2018-11-23 02:03:13,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:03:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-23 02:03:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 294. [2018-11-23 02:03:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-23 02:03:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 318 transitions. [2018-11-23 02:03:13,550 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 318 transitions. Word has length 198 [2018-11-23 02:03:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:03:13,550 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 318 transitions. [2018-11-23 02:03:13,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 02:03:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 318 transitions. [2018-11-23 02:03:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-23 02:03:13,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:03:13,551 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:03:13,551 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:03:13,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:03:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1577642532, now seen corresponding path program 1 times [2018-11-23 02:03:13,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:03:13,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:03:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:13,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:03:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:03:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 02:03:13,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:03:13,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 02:03:13,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:03:13,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:03:13,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:03:13,745 INFO L87 Difference]: Start difference. First operand 294 states and 318 transitions. Second operand 11 states. [2018-11-23 02:03:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:03:15,888 INFO L93 Difference]: Finished difference Result 303 states and 330 transitions. [2018-11-23 02:03:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:03:15,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 199 [2018-11-23 02:03:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:03:15,889 INFO L225 Difference]: With dead ends: 303 [2018-11-23 02:03:15,889 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:03:15,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:03:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:03:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:03:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:03:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:03:15,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199 [2018-11-23 02:03:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:03:15,890 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:03:15,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:03:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:03:15,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:03:15,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:03:15,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:15,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:15,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:16,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:17,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:18,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:03:19,959 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-11-23 02:03:20,360 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 45 [2018-11-23 02:03:20,476 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2018-11-23 02:03:20,801 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2018-11-23 02:03:21,187 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 97 [2018-11-23 02:03:21,897 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2018-11-23 02:03:22,439 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 75 [2018-11-23 02:03:22,631 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2018-11-23 02:03:22,934 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2018-11-23 02:03:23,234 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 98 [2018-11-23 02:03:23,803 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2018-11-23 02:03:24,061 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2018-11-23 02:03:24,162 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-11-23 02:03:25,127 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2018-11-23 02:03:25,271 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2018-11-23 02:03:25,572 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 42 [2018-11-23 02:03:25,676 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-11-23 02:03:26,241 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-11-23 02:03:26,505 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-11-23 02:03:27,006 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 76 [2018-11-23 02:03:27,316 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-11-23 02:03:27,495 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 43 [2018-11-23 02:03:27,822 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-11-23 02:03:28,228 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 53 [2018-11-23 02:03:28,572 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 31 [2018-11-23 02:03:28,945 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-11-23 02:03:29,482 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-11-23 02:03:29,817 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-11-23 02:03:30,115 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2018-11-23 02:03:30,444 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 33 [2018-11-23 02:03:30,936 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-11-23 02:03:31,478 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 60 [2018-11-23 02:03:32,109 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2018-11-23 02:03:32,529 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 62 [2018-11-23 02:03:33,204 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 1 [2018-11-23 02:03:33,859 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 52 [2018-11-23 02:03:34,186 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2018-11-23 02:03:34,528 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2018-11-23 02:03:34,906 WARN L180 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 75 [2018-11-23 02:03:35,733 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 46 [2018-11-23 02:03:36,401 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 44 [2018-11-23 02:03:36,686 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 53 [2018-11-23 02:03:36,984 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2018-11-23 02:03:37,777 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 53 [2018-11-23 02:03:38,457 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2018-11-23 02:03:38,851 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2018-11-23 02:03:39,075 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2018-11-23 02:03:39,525 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2018-11-23 02:03:39,614 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 7527 7536) no Hoare annotation was computed. [2018-11-23 02:03:39,614 INFO L451 ceAbstractionStarter]: At program point IoGetConfigurationInformationENTRY(lines 7527 7536) the Hoare annotation is: true [2018-11-23 02:03:39,614 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 7527 7536) no Hoare annotation was computed. [2018-11-23 02:03:39,614 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 7593 7616) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point L7611(lines 7593 7616) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 7593 7616) the Hoare annotation is: true [2018-11-23 02:03:39,615 INFO L451 ceAbstractionStarter]: At program point L7604(lines 7603 7613) the Hoare annotation is: true [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point L7600(lines 7600 7614) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L451 ceAbstractionStarter]: At program point L7601(lines 7600 7614) the Hoare annotation is: true [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7605 7612) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7605 7612) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 2118 2139) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 2118 2139) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= ~PagingReferenceCount~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 2118 2139) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L444 ceAbstractionStarter]: At program point L6931(line 6931) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point L6927(lines 6927 6970) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 6890 7003) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L448 ceAbstractionStarter]: For program point L6915-1(line 6915) no Hoare annotation was computed. [2018-11-23 02:03:39,615 INFO L444 ceAbstractionStarter]: At program point L6915(line 6915) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,616 INFO L444 ceAbstractionStarter]: At program point L6944(lines 6943 6966) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,616 INFO L448 ceAbstractionStarter]: For program point L6940(lines 6940 6967) no Hoare annotation was computed. [2018-11-23 02:03:39,616 INFO L444 ceAbstractionStarter]: At program point L6903(line 6903) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse8 (not (= 0 |old(~pended~0)|)))) (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse11 (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse8)) (.cse12 (not (= ~compRegistered~0 1))) (.cse7 (= ~IPC~0 ~MPR3~0)) (.cse10 (= ~SKIP2~0 ~DC~0))) (let ((.cse3 (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) (.cse13 (or .cse5 .cse11 .cse12 .cse7 .cse10)) (.cse9 (= ~NP~0 ~MPR1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 0)) .cse8 .cse9 .cse10) (or .cse5 .cse11 .cse12 .cse3 .cse10) (or (not (= |old(~setEventCalled~0)| 1)) .cse13 .cse9 (= 1 ~setEventCalled~0)) (or (= 0 ~myStatus~0) (not (= |old(~myStatus~0)| 0)) .cse13 .cse9 (not (= ~customIrp~0 0))))))) [2018-11-23 02:03:39,616 INFO L444 ceAbstractionStarter]: At program point L6961(line 6961) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,616 INFO L448 ceAbstractionStarter]: For program point $Ultimate##24(lines 6945 6965) no Hoare annotation was computed. [2018-11-23 02:03:39,616 INFO L448 ceAbstractionStarter]: For program point $Ultimate##23(lines 6945 6965) no Hoare annotation was computed. [2018-11-23 02:03:39,616 INFO L448 ceAbstractionStarter]: For program point L6949-1(line 6949) no Hoare annotation was computed. [2018-11-23 02:03:39,616 INFO L444 ceAbstractionStarter]: At program point L6949(line 6949) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,616 INFO L444 ceAbstractionStarter]: At program point L6974(lines 6902 6995) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse8 (not (= 0 |old(~pended~0)|)))) (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse11 (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse8)) (.cse12 (not (= ~compRegistered~0 1))) (.cse7 (= ~IPC~0 ~MPR3~0)) (.cse10 (= ~SKIP2~0 ~DC~0))) (let ((.cse3 (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) (.cse13 (or .cse5 .cse11 .cse12 .cse7 .cse10)) (.cse9 (= ~NP~0 ~MPR1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 0)) .cse8 .cse9 .cse10) (or .cse5 .cse11 .cse12 .cse3 .cse10) (or (not (= |old(~setEventCalled~0)| 1)) .cse13 .cse9 (= 1 ~setEventCalled~0)) (or (= 0 ~myStatus~0) (not (= |old(~myStatus~0)| 0)) .cse13 .cse9 (not (= ~customIrp~0 0))))))) [2018-11-23 02:03:39,616 INFO L448 ceAbstractionStarter]: For program point L6908-1(lines 6908 6912) no Hoare annotation was computed. [2018-11-23 02:03:39,616 INFO L448 ceAbstractionStarter]: For program point L6908(lines 6908 6912) no Hoare annotation was computed. [2018-11-23 02:03:39,616 INFO L444 ceAbstractionStarter]: At program point L6941(lines 6940 6967) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,616 INFO L448 ceAbstractionStarter]: For program point L6937(lines 6937 6968) no Hoare annotation was computed. [2018-11-23 02:03:39,616 INFO L444 ceAbstractionStarter]: At program point FloppyProcessQueuedRequestsENTRY(lines 6890 7003) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse8 (not (= 0 |old(~pended~0)|)))) (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse11 (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse8)) (.cse12 (not (= ~compRegistered~0 1))) (.cse7 (= ~IPC~0 ~MPR3~0)) (.cse10 (= ~SKIP2~0 ~DC~0))) (let ((.cse3 (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) (.cse13 (or .cse5 .cse11 .cse12 .cse7 .cse10)) (.cse9 (= ~NP~0 ~MPR1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 0)) .cse8 .cse9 .cse10) (or .cse5 .cse11 .cse12 .cse3 .cse10) (or (not (= |old(~setEventCalled~0)| 1)) .cse13 .cse9 (= 1 ~setEventCalled~0)) (or (= 0 ~myStatus~0) (not (= |old(~myStatus~0)| 0)) .cse13 .cse9 (not (= ~customIrp~0 0))))))) [2018-11-23 02:03:39,617 INFO L444 ceAbstractionStarter]: At program point L6954(line 6954) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L6954-1(line 6954) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L6917-2(lines 6902 6995) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L6979(lines 6979 6985) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L6917(lines 6917 6922) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L444 ceAbstractionStarter]: At program point L6938(lines 6934 6969) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L6934(lines 6934 6969) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L6905(lines 6905 6906) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L444 ceAbstractionStarter]: At program point L6996(lines 6890 7003) the Hoare annotation is: (let ((.cse11 (= ~SKIP1~0 ~NP~0)) (.cse12 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse16 (= ~NP~0 ~MPR3~0)) (.cse17 (not (= 0 |old(~pended~0)|)))) (let ((.cse15 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse18 (or .cse11 .cse12 .cse3 .cse13 .cse16 .cse17)) (.cse19 (not (= ~compRegistered~0 1))) (.cse4 (= ~IPC~0 ~MPR3~0)) (.cse5 (= ~SKIP2~0 ~DC~0)) (.cse8 (= ~NP~0 ~s~0)) (.cse14 (= ~pended~0 1))) (let ((.cse7 (= FloppyProcessQueuedRequests_~headOfList~0.offset 0)) (.cse9 (= FloppyProcessQueuedRequests_~headOfList~0.base 0)) (.cse10 (= ~PagingReferenceCount~0 1)) (.cse6 (= 0 ~pended~0)) (.cse0 (and (not .cse5) (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~IPC~0 ~DC~0)) (= ~s~0 |old(~s~0)|) .cse8 .cse14 (not (= ~MPR3~0 ~NP~0)) (not .cse11))) (.cse1 (or .cse15 .cse18 .cse19 .cse4 .cse5)) (.cse2 (= ~NP~0 ~MPR1~0))) (and (or (not (= |old(~setEventCalled~0)| 1)) .cse0 (= 1 ~setEventCalled~0) .cse1 .cse2) (or .cse3 .cse4 .cse2 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 (and .cse8 .cse14) .cse15 .cse16 (not (= ~compRegistered~0 0)) .cse17) (or .cse0 .cse1 .cse2 (and .cse7 .cse9 .cse10)) (or (and .cse6 .cse8) .cse0 .cse15 .cse18 .cse19 .cse5) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (= 0 ~myStatus~0) .cse2 (not (= ~customIrp~0 0))))))) [2018-11-23 02:03:39,617 INFO L444 ceAbstractionStarter]: At program point L6926(lines 6902 6995) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 (= ~NP~0 ~MPR1~0) .cse7))) [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L3896(lines 3896 3906) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L451 ceAbstractionStarter]: At program point L3830(line 3830) the Hoare annotation is: true [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L3830-1(line 3830) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteFINAL(lines 3815 3909) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L451 ceAbstractionStarter]: At program point FloppyReadWriteENTRY(lines 3815 3909) the Hoare annotation is: true [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L3843(lines 3843 3859) no Hoare annotation was computed. [2018-11-23 02:03:39,617 INFO L451 ceAbstractionStarter]: At program point L3844(lines 3840 3860) the Hoare annotation is: true [2018-11-23 02:03:39,617 INFO L451 ceAbstractionStarter]: At program point L3877(lines 3861 3895) the Hoare annotation is: true [2018-11-23 02:03:39,617 INFO L448 ceAbstractionStarter]: For program point L3840(lines 3840 3860) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L451 ceAbstractionStarter]: At program point L3902(line 3902) the Hoare annotation is: true [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3865(lines 3865 3874) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3828(lines 3828 3836) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3861(lines 3861 3895) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteEXIT(lines 3815 3909) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L451 ceAbstractionStarter]: At program point L3882(line 3882) the Hoare annotation is: true [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3878(lines 3878 3894) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3845(lines 3845 3849) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3878-1(lines 3820 3908) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3845-2(lines 3845 3849) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L451 ceAbstractionStarter]: At program point L3866(lines 3862 3875) the Hoare annotation is: true [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3862(lines 3862 3875) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3891-1(line 3891) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L451 ceAbstractionStarter]: At program point L3891(line 3891) the Hoare annotation is: true [2018-11-23 02:03:39,618 INFO L451 ceAbstractionStarter]: At program point L3854(line 3854) the Hoare annotation is: true [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L3854-1(line 3854) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L7642(lines 7627 7647) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L451 ceAbstractionStarter]: At program point L7635(lines 7634 7644) the Hoare annotation is: true [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 7627 7647) no Hoare annotation was computed. [2018-11-23 02:03:39,618 INFO L448 ceAbstractionStarter]: For program point L7631(lines 7631 7645) no Hoare annotation was computed. [2018-11-23 02:03:39,619 INFO L451 ceAbstractionStarter]: At program point L7632(lines 7631 7645) the Hoare annotation is: true [2018-11-23 02:03:39,619 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 7627 7647) the Hoare annotation is: true [2018-11-23 02:03:39,619 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7636 7643) no Hoare annotation was computed. [2018-11-23 02:03:39,619 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7636 7643) no Hoare annotation was computed. [2018-11-23 02:03:39,619 INFO L448 ceAbstractionStarter]: For program point L3322(lines 3322 3328) no Hoare annotation was computed. [2018-11-23 02:03:39,619 INFO L448 ceAbstractionStarter]: For program point L3355(lines 3355 3368) no Hoare annotation was computed. [2018-11-23 02:03:39,619 INFO L448 ceAbstractionStarter]: For program point L3322-2(lines 3322 3328) no Hoare annotation was computed. [2018-11-23 02:03:39,619 INFO L444 ceAbstractionStarter]: At program point L3223(lines 3222 3498) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,619 INFO L448 ceAbstractionStarter]: For program point L3405(lines 3405 3411) no Hoare annotation was computed. [2018-11-23 02:03:39,619 INFO L448 ceAbstractionStarter]: For program point L3240(lines 3240 3492) no Hoare annotation was computed. [2018-11-23 02:03:39,619 INFO L444 ceAbstractionStarter]: At program point L3241(lines 3240 3492) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,620 INFO L444 ceAbstractionStarter]: At program point L3489(lines 3245 3490) the Hoare annotation is: (let ((.cse1 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~DC~0)) (.cse0 (= ~s~0 ~SKIP2~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse4 (= ~pended~0 1))) (or (and .cse0 .cse1 .cse2 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (and .cse3 .cse4) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= FloppyPnp_~ntStatus~3 259)) (or (and .cse1 .cse2 .cse3) (and (= ~compRegistered~0 1) .cse1 .cse3))) (and .cse0 .cse2 .cse4))) [2018-11-23 02:03:39,620 INFO L444 ceAbstractionStarter]: At program point L3357(line 3357) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,620 INFO L448 ceAbstractionStarter]: For program point L3225(lines 3225 3497) no Hoare annotation was computed. [2018-11-23 02:03:39,620 INFO L444 ceAbstractionStarter]: At program point L3308(line 3308) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~SKIP1~0 ~s~0))) (or (and (= 0 ~pended~0) .cse0 (= |old(~customIrp~0)| ~customIrp~0) (<= FloppyPnp_~ntStatus~3 259) (<= 259 FloppyPnp_~ntStatus~3) .cse1) (and .cse0 (= ~pended~0 1) .cse1) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,620 INFO L448 ceAbstractionStarter]: For program point L3308-1(line 3308) no Hoare annotation was computed. [2018-11-23 02:03:39,620 INFO L448 ceAbstractionStarter]: For program point L3457(lines 3457 3465) no Hoare annotation was computed. [2018-11-23 02:03:39,620 INFO L448 ceAbstractionStarter]: For program point L3391-1(line 3391) no Hoare annotation was computed. [2018-11-23 02:03:39,620 INFO L444 ceAbstractionStarter]: At program point L3391(line 3391) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (and (= ~compRegistered~0 1) (= 0 ~pended~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~NP~0 ~s~0)) (= ~PagingReferenceCount~0 1))) [2018-11-23 02:03:39,620 INFO L444 ceAbstractionStarter]: At program point L3457-2(lines 3457 3465) the Hoare annotation is: (let ((.cse1 (= 0 ~compRegistered~0)) (.cse0 (= ~s~0 ~SKIP2~0))) (or (and .cse0 .cse1 (= ~pended~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) .cse1 .cse0 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1)))) [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3441-1(line 3441) no Hoare annotation was computed. [2018-11-23 02:03:39,621 INFO L444 ceAbstractionStarter]: At program point L3441(line 3441) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~SKIP1~0 ~s~0))) (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) .cse0 (= ~PagingReferenceCount~0 1) .cse1) (and .cse0 (= ~pended~0 1) .cse1) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,621 INFO L444 ceAbstractionStarter]: At program point L3342(line 3342) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3342-1(line 3342) no Hoare annotation was computed. [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3260(lines 3260 3276) no Hoare annotation was computed. [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3409-1(lines 3405 3411) no Hoare annotation was computed. [2018-11-23 02:03:39,621 INFO L444 ceAbstractionStarter]: At program point L3409(line 3409) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,621 INFO L444 ceAbstractionStarter]: At program point L3244(lines 3243 3491) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3211(lines 3211 3221) no Hoare annotation was computed. [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3459-1(line 3459) no Hoare annotation was computed. [2018-11-23 02:03:39,621 INFO L444 ceAbstractionStarter]: At program point L3459(line 3459) the Hoare annotation is: (let ((.cse1 (= 0 ~compRegistered~0)) (.cse0 (= ~s~0 ~SKIP2~0))) (or (and .cse0 .cse1 (= ~pended~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) .cse1 .cse0 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1)))) [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3360(lines 3360 3367) no Hoare annotation was computed. [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3360-1(lines 3355 3368) no Hoare annotation was computed. [2018-11-23 02:03:39,621 INFO L448 ceAbstractionStarter]: For program point L3228(lines 3228 3496) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3261(lines 3261 3267) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3443(lines 3443 3452) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3377-1(line 3377) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L444 ceAbstractionStarter]: At program point L3377(line 3377) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= ~compRegistered~0 1) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3443-2(lines 3443 3452) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3427-1(lines 3245 3488) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L444 ceAbstractionStarter]: At program point L3427(line 3427) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 3181 3515) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L444 ceAbstractionStarter]: At program point L3229(lines 3225 3497) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,622 INFO L444 ceAbstractionStarter]: At program point L3362(line 3362) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,622 INFO L444 ceAbstractionStarter]: At program point L3395(line 3395) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0))) (or (and .cse0 (= ~pended~0 1)) (and (= ~compRegistered~0 1) (= 0 ~pended~0) (not (= FloppyPnp_~ntStatus~3 259)) .cse0) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3329(lines 3329 3397) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3445-1(lines 3445 3446) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L444 ceAbstractionStarter]: At program point L3445(lines 3445 3446) the Hoare annotation is: (let ((.cse1 (= 0 ~compRegistered~0)) (.cse0 (= ~s~0 ~SKIP2~0))) (or (and .cse0 .cse1 (= ~pended~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) .cse1 .cse0 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1)))) [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3379(lines 3379 3386) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 3181 3515) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3379-2(lines 3379 3386) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3231(lines 3231 3495) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3248(line 3248) no Hoare annotation was computed. [2018-11-23 02:03:39,622 INFO L448 ceAbstractionStarter]: For program point L3281-1(line 3281) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L444 ceAbstractionStarter]: At program point L3281(line 3281) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3298(lines 3298 3304) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3265-1(lines 3261 3267) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L444 ceAbstractionStarter]: At program point L3265(line 3265) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3199(lines 3199 3205) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3199-2(lines 3199 3205) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L444 ceAbstractionStarter]: At program point L3480(line 3480) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3480-1(lines 3476 3482) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3381-1(line 3381) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L444 ceAbstractionStarter]: At program point L3381(line 3381) the Hoare annotation is: (let ((.cse7 (= 0 ~pended~0)) (.cse0 (= ~compRegistered~0 1)) (.cse1 (= 0 ~myStatus~0)) (.cse2 (= 1 ~setEventCalled~0)) (.cse3 (= ~PagingReferenceCount~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (<= FloppyPnp_~ntStatus~3 259)) (.cse6 (<= 259 FloppyPnp_~ntStatus~3))) (or (and .cse0 .cse1 (= ~MPR3~0 ~s~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse7 .cse0 .cse1 (= ~NP~0 ~s~0) .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,623 INFO L444 ceAbstractionStarter]: At program point L3216(line 3216) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3216-1(line 3216) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 3245 3490) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 3245 3490) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3332(lines 3332 3338) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3415-1(line 3415) no Hoare annotation was computed. [2018-11-23 02:03:39,623 INFO L444 ceAbstractionStarter]: At program point L3415(line 3415) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,623 INFO L444 ceAbstractionStarter]: At program point L3316(line 3316) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 (= ~pended~0 1)) (and (= 0 ~pended~0) .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,623 INFO L448 ceAbstractionStarter]: For program point L3283(lines 3283 3318) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3234(lines 3234 3494) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L444 ceAbstractionStarter]: At program point L3350(line 3350) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,624 INFO L444 ceAbstractionStarter]: At program point L3350-1(line 3350) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3433-1(lines 3429 3435) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L444 ceAbstractionStarter]: At program point L3433(line 3433) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,624 INFO L444 ceAbstractionStarter]: At program point L3235(lines 3231 3495) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3351(line 3351) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3285-1(lines 3285 3286) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L444 ceAbstractionStarter]: At program point L3285(lines 3285 3286) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 (= ~pended~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) .cse0 .cse1 (= |old(~customIrp~0)| ~customIrp~0) (<= FloppyPnp_~ntStatus~3 259) (<= 259 FloppyPnp_~ntStatus~3)))) [2018-11-23 02:03:39,624 INFO L444 ceAbstractionStarter]: At program point L3302(line 3302) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3302-1(lines 3298 3304) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3253(lines 3253 3259) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3253-2(lines 3253 3259) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L444 ceAbstractionStarter]: At program point L3336(line 3336) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3336-1(lines 3332 3338) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3237(lines 3237 3493) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L448 ceAbstractionStarter]: For program point L3469(line 3469) no Hoare annotation was computed. [2018-11-23 02:03:39,624 INFO L444 ceAbstractionStarter]: At program point L3238(lines 3237 3493) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L3271-1(line 3271) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L444 ceAbstractionStarter]: At program point L3271(line 3271) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,625 INFO L444 ceAbstractionStarter]: At program point L3486(line 3486) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L3486-1(line 3486) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L3288(lines 3288 3294) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L3222(lines 3222 3498) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L3288-2(lines 3288 3294) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L3503(lines 3503 3509) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L3503-2(lines 3503 3509) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 3181 3515) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L7104(line 7104) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 7041 7217) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L7096(lines 7096 7133) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L444 ceAbstractionStarter]: At program point L7088(lines 7087 7136) the Hoare annotation is: (or (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~NP~0))) (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,625 INFO L448 ceAbstractionStarter]: For program point L7171(lines 7171 7181) no Hoare annotation was computed. [2018-11-23 02:03:39,625 INFO L444 ceAbstractionStarter]: At program point L7130(lines 7060 7145) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~DC~0))) (let ((.cse7 (not .cse2)) (.cse9 (= ~s~0 ~SKIP2~0)) (.cse0 (not (= ~MPR1~0 ~SKIP1~0))) (.cse8 (not (= ~IPC~0 ~DC~0))) (.cse11 (= 0 ~compRegistered~0)) (.cse3 (= ~pended~0 1)) (.cse6 (not (= ~SKIP1~0 ~NP~0))) (.cse10 (= 0 ~pended~0)) (.cse1 (not (= ~SKIP2~0 ~s~0))) (.cse4 (not (= ~IPC~0 ~s~0))) (.cse5 (not (= ~MPR3~0 ~NP~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (and (= main_~status~4 ~lowerDriverReturn~0) .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse5 .cse6) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (or (and (= ~compRegistered~0 1) .cse0 .cse10 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse10 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6)) (not (= 259 main_~status~4))) (not (= |old(~compRegistered~0)| 0)) (and .cse10 .cse1 (= 0 main_~status~4) .cse2 .cse4 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse11 .cse3 .cse5 .cse6) (and (not (= ~SKIP2~0 ~DC~0)) .cse0 .cse8 .cse11 (= ~NP~0 ~s~0) .cse3 .cse5 .cse6) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse10 .cse1 .cse2 .cse4 .cse5 (= 0 (+ main_~status~4 2147483631))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= 0 (+ main_~status~4 1073741738)) .cse10 .cse1 .cse2 .cse4 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,626 INFO L444 ceAbstractionStarter]: At program point L7163(lines 7156 7212) the Hoare annotation is: (let ((.cse6 (not (= ~MPR3~0 ~NP~0))) (.cse9 (= ~s~0 ~DC~0))) (let ((.cse1 (not .cse9)) (.cse3 (not (= ~IPC~0 ~DC~0))) (.cse4 (= ~s~0 ~SKIP2~0)) (.cse5 (= 0 ~compRegistered~0)) (.cse2 (not (= ~MPR1~0 ~SKIP1~0))) (.cse8 (= ~pended~0 1)) (.cse7 (not (= ~SKIP1~0 ~NP~0))) (.cse0 (and (not (= ~SKIP2~0 ~s~0)) .cse9 (not (= ~IPC~0 ~s~0)) .cse6))) (or (and (= 0 main_~status~4) .cse0) (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (= 0 (+ main_~status~4 1073741738)) .cse0) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= main_~status~4 ~lowerDriverReturn~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7) (and (or (and (= ~compRegistered~0 1) .cse2 .cse7 .cse0) (and .cse2 .cse5 .cse7 .cse0)) (not (= 259 main_~status~4))) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 (+ main_~status~4 2147483631)) .cse0) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and .cse2 .cse8 .cse7 .cse0) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,626 INFO L444 ceAbstractionStarter]: At program point L7097(lines 7096 7133) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~IPC~0 ~DC~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~NP~0)) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,626 INFO L444 ceAbstractionStarter]: At program point L7155(lines 7148 7213) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~DC~0))) (let ((.cse7 (not .cse2)) (.cse0 (not (= ~MPR1~0 ~SKIP1~0))) (.cse8 (not (= ~IPC~0 ~DC~0))) (.cse9 (= ~s~0 ~SKIP2~0)) (.cse11 (= 0 ~compRegistered~0)) (.cse3 (= ~pended~0 1)) (.cse6 (not (= ~SKIP1~0 ~NP~0))) (.cse10 (= 0 ~pended~0)) (.cse1 (not (= ~SKIP2~0 ~s~0))) (.cse4 (not (= ~IPC~0 ~s~0))) (.cse5 (not (= ~MPR3~0 ~NP~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (and (= main_~status~4 ~lowerDriverReturn~0) .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse5 .cse6) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (or (and (= ~compRegistered~0 1) .cse0 .cse10 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse10 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6)) (not (= 259 main_~status~4))) (not (= |old(~compRegistered~0)| 0)) (and .cse10 .cse1 (= 0 main_~status~4) .cse2 .cse4 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse11 .cse3 .cse5 .cse6) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse10 .cse1 .cse2 .cse4 .cse5 (= 0 (+ main_~status~4 2147483631))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= 0 (+ main_~status~4 1073741738)) .cse10 .cse1 .cse2 .cse4 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,626 INFO L448 ceAbstractionStarter]: For program point L7114(line 7114) no Hoare annotation was computed. [2018-11-23 02:03:39,626 INFO L448 ceAbstractionStarter]: For program point L7172(lines 7172 7178) no Hoare annotation was computed. [2018-11-23 02:03:39,626 INFO L448 ceAbstractionStarter]: For program point L7090(lines 7090 7135) no Hoare annotation was computed. [2018-11-23 02:03:39,626 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 7101 7131) no Hoare annotation was computed. [2018-11-23 02:03:39,626 INFO L444 ceAbstractionStarter]: At program point L7057-1(line 7057) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~s~0 ~DC~0)) (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= ~SKIP2~0 ~s~0)) (= ~s~0 ~UNLOADED~0) (= 0 main_~status~4) (not (= ~MPR3~0 ~IPC~0)) (not (= ~IPC~0 ~s~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= 0 ~myStatus~0) (not (= ~MPR3~0 ~s~0)) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~MPR3~0 ~NP~0)) (= ~PagingReferenceCount~0 0) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,626 INFO L444 ceAbstractionStarter]: At program point L7057(line 7057) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= 0 main_~status~4) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~PagingReferenceCount~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,626 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 7041 7217) no Hoare annotation was computed. [2018-11-23 02:03:39,626 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 7101 7131) no Hoare annotation was computed. [2018-11-23 02:03:39,626 INFO L444 ceAbstractionStarter]: At program point L7140(line 7140) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~DC~0))) (let ((.cse7 (not .cse2)) (.cse9 (= ~s~0 ~SKIP2~0)) (.cse0 (not (= ~MPR1~0 ~SKIP1~0))) (.cse8 (not (= ~IPC~0 ~DC~0))) (.cse11 (= 0 ~compRegistered~0)) (.cse3 (= ~pended~0 1)) (.cse6 (not (= ~SKIP1~0 ~NP~0))) (.cse10 (= 0 ~pended~0)) (.cse1 (not (= ~SKIP2~0 ~s~0))) (.cse4 (not (= ~IPC~0 ~s~0))) (.cse5 (not (= ~MPR3~0 ~NP~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (and (= main_~status~4 ~lowerDriverReturn~0) .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse5 .cse6) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (or (and (= ~compRegistered~0 1) .cse0 .cse10 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse10 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6)) (not (= 259 main_~status~4))) (not (= |old(~compRegistered~0)| 0)) (and .cse10 .cse1 (= 0 main_~status~4) .cse2 .cse4 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse11 .cse3 .cse5 .cse6) (and (not (= ~SKIP2~0 ~DC~0)) .cse0 .cse8 .cse11 (= ~NP~0 ~s~0) .cse3 .cse5 .cse6) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse10 .cse1 .cse2 .cse4 .cse5 (= 0 (+ main_~status~4 2147483631))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= 0 (+ main_~status~4 1073741738)) .cse10 .cse1 .cse2 .cse4 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,627 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 7041 7217) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~PagingReferenceCount~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,627 INFO L448 ceAbstractionStarter]: For program point L7058(line 7058) no Hoare annotation was computed. [2018-11-23 02:03:39,627 INFO L444 ceAbstractionStarter]: At program point L7091(lines 7090 7135) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= ~MPR3~0 ~IPC~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~MPR3~0 ~NP~0)) (= ~PagingReferenceCount~0 0) (not (= ~SKIP1~0 ~NP~0))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,627 INFO L448 ceAbstractionStarter]: For program point L7124(line 7124) no Hoare annotation was computed. [2018-11-23 02:03:39,627 INFO L448 ceAbstractionStarter]: For program point L7157(lines 7157 7161) no Hoare annotation was computed. [2018-11-23 02:03:39,627 INFO L448 ceAbstractionStarter]: For program point L7149(lines 7149 7153) no Hoare annotation was computed. [2018-11-23 02:03:39,627 INFO L444 ceAbstractionStarter]: At program point L7174(line 7174) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,627 INFO L451 ceAbstractionStarter]: At program point L7100(lines 7099 7132) the Hoare annotation is: true [2018-11-23 02:03:39,627 INFO L448 ceAbstractionStarter]: For program point L7191(lines 7191 7207) no Hoare annotation was computed. [2018-11-23 02:03:39,627 INFO L444 ceAbstractionStarter]: At program point L7183(lines 7170 7209) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 ~s~0))) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (not (= ~IPC~0 ~s~0))) (.cse6 (not (= ~MPR1~0 ~SKIP1~0))) (.cse7 (not (= ~SKIP2~0 ~DC~0))) (.cse8 (not (= ~IPC~0 ~DC~0))) (.cse5 (= 0 ~compRegistered~0)) (.cse3 (not (= ~MPR3~0 ~NP~0))) (.cse11 (not (= ~SKIP1~0 ~NP~0)))) (let ((.cse9 (= ~s~0 ~SKIP2~0)) (.cse4 (or (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse11) (and (= main_~status~4 ~lowerDriverReturn~0) .cse6 .cse7 .cse8 .cse5 .cse3 .cse11))) (.cse10 (= ~pended~0 1))) (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (= 0 main_~status~4) .cse1 .cse2 .cse3) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse0 .cse1 .cse2 .cse3 (= 0 (+ main_~status~4 2147483631))) (not (= |old(~compRegistered~0)| 0)) (and (not (= 259 main_~status~4)) (or (and (= ~compRegistered~0 1) .cse4) (and .cse5 .cse4))) (and .cse6 .cse7 .cse8 .cse9 .cse5 .cse10 .cse3 .cse11) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse9 .cse4) (and (= 0 (+ main_~status~4 1073741738)) .cse0 .cse1 .cse2 .cse3) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse4 .cse10) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,627 INFO L448 ceAbstractionStarter]: For program point L7084(lines 7084 7137) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L448 ceAbstractionStarter]: For program point L7109(line 7109) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L448 ceAbstractionStarter]: For program point L7167(lines 7167 7210) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L448 ceAbstractionStarter]: For program point L7200-1(lines 7148 7213) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L448 ceAbstractionStarter]: For program point L7200(lines 7200 7206) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L448 ceAbstractionStarter]: For program point L7192(lines 7192 7198) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L448 ceAbstractionStarter]: For program point L7060-1(lines 7053 7216) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L448 ceAbstractionStarter]: For program point L7060(lines 7060 7147) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L448 ceAbstractionStarter]: For program point L7093(lines 7093 7134) no Hoare annotation was computed. [2018-11-23 02:03:39,628 INFO L444 ceAbstractionStarter]: At program point L7085(lines 7084 7137) the Hoare annotation is: (or (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= 0 ~pended~0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~NP~0))) (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,631 INFO L448 ceAbstractionStarter]: For program point L7077(lines 7060 7145) no Hoare annotation was computed. [2018-11-23 02:03:39,631 INFO L444 ceAbstractionStarter]: At program point L7094(lines 7093 7134) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= ~MPR3~0 ~IPC~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~MPR3~0 ~NP~0)) (= ~PagingReferenceCount~0 0) (not (= ~SKIP1~0 ~NP~0))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,631 INFO L448 ceAbstractionStarter]: For program point L7119(line 7119) no Hoare annotation was computed. [2018-11-23 02:03:39,631 INFO L448 ceAbstractionStarter]: For program point L7185(lines 7185 7189) no Hoare annotation was computed. [2018-11-23 02:03:39,631 INFO L444 ceAbstractionStarter]: At program point L7202(line 7202) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,631 INFO L448 ceAbstractionStarter]: For program point L7070(lines 7070 7075) no Hoare annotation was computed. [2018-11-23 02:03:39,631 INFO L444 ceAbstractionStarter]: At program point L7194(line 7194) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,632 INFO L444 ceAbstractionStarter]: At program point L7070-2(lines 7070 7075) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= ~MPR3~0 ~IPC~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~MPR3~0 ~NP~0)) (= ~PagingReferenceCount~0 0) (not (= ~SKIP1~0 ~NP~0))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point L7087(lines 7087 7136) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point L7170(lines 7170 7209) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedInsertTailListENTRY(lines 7273 7281) the Hoare annotation is: true [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 7273 7281) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 7273 7281) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 2667 2681) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point L2677-1(line 2677) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L444 ceAbstractionStarter]: At program point L2677(line 2677) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (= ~NP~0 ~s~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,641 INFO L444 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 2667 2681) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (= ~NP~0 ~s~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 2667 2681) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point L7664-1(lines 7656 7669) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L444 ceAbstractionStarter]: At program point L7664(line 7664) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0)) [2018-11-23 02:03:39,641 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 7656 7669) the Hoare annotation is: (or (or (not (= ~setEventCalled~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0)) (= ~NP~0 ~s~0)) [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 7656 7669) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point L8062(lines 8062 8079) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point L8021-1(line 8021) no Hoare annotation was computed. [2018-11-23 02:03:39,641 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 8011 8083) no Hoare annotation was computed. [2018-11-23 02:03:39,650 INFO L444 ceAbstractionStarter]: At program point L8021(line 8021) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,650 INFO L444 ceAbstractionStarter]: At program point L8038(lines 8037 8056) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP1~0 ~s~0) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,650 INFO L448 ceAbstractionStarter]: For program point L8071(lines 8071 8078) no Hoare annotation was computed. [2018-11-23 02:03:39,650 INFO L448 ceAbstractionStarter]: For program point L8063(lines 8063 8069) no Hoare annotation was computed. [2018-11-23 02:03:39,650 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 8011 8083) no Hoare annotation was computed. [2018-11-23 02:03:39,650 INFO L444 ceAbstractionStarter]: At program point L8026(line 8026) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,650 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 8011 8083) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP1~0 ~s~0) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,650 INFO L448 ceAbstractionStarter]: For program point L8076-1(lines 8058 8080) no Hoare annotation was computed. [2018-11-23 02:03:39,650 INFO L444 ceAbstractionStarter]: At program point L8076(line 8076) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,650 INFO L444 ceAbstractionStarter]: At program point L8035(lines 8034 8057) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP1~0 ~s~0) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,650 INFO L448 ceAbstractionStarter]: For program point L8019-1(lines 8018 8082) no Hoare annotation was computed. [2018-11-23 02:03:39,650 INFO L448 ceAbstractionStarter]: For program point L8019(lines 8019 8033) no Hoare annotation was computed. [2018-11-23 02:03:39,651 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 8042 8054) no Hoare annotation was computed. [2018-11-23 02:03:39,651 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 8042 8054) no Hoare annotation was computed. [2018-11-23 02:03:39,651 INFO L448 ceAbstractionStarter]: For program point L8024(lines 8024 8030) no Hoare annotation was computed. [2018-11-23 02:03:39,651 INFO L444 ceAbstractionStarter]: At program point L8053(lines 8018 8082) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP1~0 ~s~0) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,651 INFO L444 ceAbstractionStarter]: At program point L8041(lines 8040 8055) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP1~0 ~s~0) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,651 INFO L448 ceAbstractionStarter]: For program point L8037(lines 8037 8056) no Hoare annotation was computed. [2018-11-23 02:03:39,666 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 7284 7291) no Hoare annotation was computed. [2018-11-23 02:03:39,666 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedRemoveHeadListENTRY(lines 7284 7291) the Hoare annotation is: true [2018-11-23 02:03:39,666 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 7284 7291) no Hoare annotation was computed. [2018-11-23 02:03:39,666 INFO L448 ceAbstractionStarter]: For program point L3772(lines 3772 3778) no Hoare annotation was computed. [2018-11-23 02:03:39,666 INFO L444 ceAbstractionStarter]: At program point L3706(lines 3705 3796) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,666 INFO L448 ceAbstractionStarter]: For program point FloppyPowerEXIT(lines 3688 3814) no Hoare annotation was computed. [2018-11-23 02:03:39,666 INFO L444 ceAbstractionStarter]: At program point L3810(line 3810) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP1~0 ~s~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,666 INFO L448 ceAbstractionStarter]: For program point L3810-1(line 3810) no Hoare annotation was computed. [2018-11-23 02:03:39,666 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 3713 3793) no Hoare annotation was computed. [2018-11-23 02:03:39,666 INFO L444 ceAbstractionStarter]: At program point FloppyPowerENTRY(lines 3688 3814) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point L3757(lines 3757 3767) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point L3757-2(lines 3757 3767) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point L3753(lines 3753 3784) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L444 ceAbstractionStarter]: At program point L3774(line 3774) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point L3708(lines 3708 3795) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point L3741-1(line 3741) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L444 ceAbstractionStarter]: At program point L3741(line 3741) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point L3774-1(line 3774) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point L3717-1(lines 3717 3726) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 3713 3793) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L448 ceAbstractionStarter]: For program point FloppyPowerFINAL(lines 3688 3814) no Hoare annotation was computed. [2018-11-23 02:03:39,667 INFO L444 ceAbstractionStarter]: At program point L3804(line 3804) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,673 INFO L444 ceAbstractionStarter]: At program point L3709(lines 3708 3795) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,673 INFO L448 ceAbstractionStarter]: For program point L3771(lines 3771 3781) no Hoare annotation was computed. [2018-11-23 02:03:39,673 INFO L448 ceAbstractionStarter]: For program point L3804-1(lines 3800 3806) no Hoare annotation was computed. [2018-11-23 02:03:39,673 INFO L448 ceAbstractionStarter]: For program point L3705(lines 3705 3796) no Hoare annotation was computed. [2018-11-23 02:03:39,673 INFO L448 ceAbstractionStarter]: For program point L3730(lines 3730 3746) no Hoare annotation was computed. [2018-11-23 02:03:39,673 INFO L444 ceAbstractionStarter]: At program point L3792(lines 3696 3813) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~NP~0 ~s~0) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,673 INFO L448 ceAbstractionStarter]: For program point L3718(lines 3718 3723) no Hoare annotation was computed. [2018-11-23 02:03:39,673 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 3678 3687) the Hoare annotation is: true [2018-11-23 02:03:39,673 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 3678 3687) no Hoare annotation was computed. [2018-11-23 02:03:39,673 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 3678 3687) no Hoare annotation was computed. [2018-11-23 02:03:39,673 INFO L448 ceAbstractionStarter]: For program point L3683-1(line 3683) no Hoare annotation was computed. [2018-11-23 02:03:39,673 INFO L451 ceAbstractionStarter]: At program point L3683(line 3683) the Hoare annotation is: true [2018-11-23 02:03:39,674 INFO L444 ceAbstractionStarter]: At program point L7866(lines 7858 7879) the Hoare annotation is: (let ((.cse13 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse14 (not (= ~compRegistered~0 0))) (.cse12 (= ~NP~0 ~s~0)) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse6 (not (= ~compRegistered~0 1))) (.cse8 (= ~IPC~0 ~MPR3~0)) (.cse10 (= ~NP~0 ~MPR1~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse7 (= ~NP~0 ~MPR3~0)) (.cse9 (not (= 0 ~pended~0))) (.cse11 (= ~SKIP2~0 ~DC~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (= 1 ~setEventCalled~0) .cse13)) (or .cse1 .cse2 (not (= 1 ~pended~0)) .cse3 .cse4 .cse12 .cse7 .cse14 .cse11) (or .cse13 (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse14 .cse9 .cse11) .cse8 .cse10 (not (= |old(~customIrp~0)| 0))) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse14 .cse9 .cse12 .cse11) (or .cse0 .cse5 .cse6 .cse8 .cse10 (not (= |old(~s~0)| ~MPR3~0)) (or .cse3 (or .cse1 .cse2 .cse7 .cse9 .cse11))))) [2018-11-23 02:03:39,674 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 7853 7896) no Hoare annotation was computed. [2018-11-23 02:03:39,674 INFO L448 ceAbstractionStarter]: For program point L7858(lines 7858 7879) no Hoare annotation was computed. [2018-11-23 02:03:39,674 INFO L448 ceAbstractionStarter]: For program point L7891(lines 7853 7896) no Hoare annotation was computed. [2018-11-23 02:03:39,674 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 7885 7892) no Hoare annotation was computed. [2018-11-23 02:03:39,674 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 7885 7892) no Hoare annotation was computed. [2018-11-23 02:03:39,681 INFO L444 ceAbstractionStarter]: At program point L7881(lines 7880 7894) the Hoare annotation is: (let ((.cse18 (= 0 ~pended~0)) (.cse17 (= ~compRegistered~0 1)) (.cse19 (= ~PagingReferenceCount~0 1))) (let ((.cse9 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (not .cse19)) (.cse11 (not .cse17)) (.cse12 (= ~IPC~0 ~MPR3~0)) (.cse13 (= ~NP~0 ~MPR1~0)) (.cse8 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= ~compRegistered~0 0))) (.cse14 (not .cse18)) (.cse7 (= ~SKIP2~0 ~DC~0)) (.cse4 (= ~NP~0 ~s~0))) (and (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (and .cse4 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |old(~s~0)| ~MPR3~0)) (or .cse2 (or .cse0 .cse1 .cse5 .cse14 .cse7)))) (or (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse7) .cse8 .cse12 .cse13 (not (= |old(~customIrp~0)| 0))) (let ((.cse15 (and .cse17 (and (not (= ~MPR1~0 ~SKIP1~0)) (not .cse7) (not (= ~IPC~0 ~DC~0)) .cse18 .cse4 (= ~NP~0 |old(~s~0)|) (not (= ~MPR3~0 ~NP~0)) (not .cse0)) (not (= ~MPR3~0 ~IPC~0)) .cse19)) (.cse16 (= 1 ~setEventCalled~0))) (or (and (= |old(~customIrp~0)| 1) .cse15 (= 0 ~customIrp~0) .cse16) (or .cse9 .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse14 .cse13 .cse7) (and .cse15 .cse16 .cse8))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse7 .cse4)))) [2018-11-23 02:03:39,681 INFO L448 ceAbstractionStarter]: For program point L7871-1(lines 7857 7895) no Hoare annotation was computed. [2018-11-23 02:03:39,681 INFO L448 ceAbstractionStarter]: For program point L7871(lines 7871 7877) no Hoare annotation was computed. [2018-11-23 02:03:39,681 INFO L444 ceAbstractionStarter]: At program point L7873(line 7873) the Hoare annotation is: (let ((.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (= ~compRegistered~0 0))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse6 (not (= ~compRegistered~0 1))) (.cse8 (= ~IPC~0 ~MPR3~0)) (.cse10 (= ~NP~0 ~MPR1~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse7 (= ~NP~0 ~MPR3~0)) (.cse9 (not (= 0 ~pended~0))) (.cse11 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 (not (= 1 ~pended~0)) .cse3 .cse4 .cse7 .cse12 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse12 .cse9 .cse11) (or .cse0 .cse5 .cse6 .cse8 .cse10 (not (= |old(~s~0)| ~MPR3~0)) (or .cse3 (or .cse1 .cse2 .cse7 .cse9 .cse11))))) [2018-11-23 02:03:39,681 INFO L448 ceAbstractionStarter]: For program point L7859(lines 7859 7864) no Hoare annotation was computed. [2018-11-23 02:03:39,681 INFO L444 ceAbstractionStarter]: At program point L7884(lines 7883 7893) the Hoare annotation is: (let ((.cse18 (= 0 ~pended~0)) (.cse17 (= ~compRegistered~0 1)) (.cse19 (= ~PagingReferenceCount~0 1))) (let ((.cse9 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (not .cse19)) (.cse11 (not .cse17)) (.cse12 (= ~IPC~0 ~MPR3~0)) (.cse13 (= ~NP~0 ~MPR1~0)) (.cse8 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= ~compRegistered~0 0))) (.cse14 (not .cse18)) (.cse7 (= ~SKIP2~0 ~DC~0)) (.cse4 (= ~NP~0 ~s~0))) (and (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (and .cse4 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |old(~s~0)| ~MPR3~0)) (or .cse2 (or .cse0 .cse1 .cse5 .cse14 .cse7)))) (or (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse7) .cse8 .cse12 .cse13 (not (= |old(~customIrp~0)| 0))) (let ((.cse15 (and .cse17 (and (not (= ~MPR1~0 ~SKIP1~0)) (not .cse7) (not (= ~IPC~0 ~DC~0)) .cse18 .cse4 (= ~NP~0 |old(~s~0)|) (not (= ~MPR3~0 ~NP~0)) (not .cse0)) (not (= ~MPR3~0 ~IPC~0)) .cse19)) (.cse16 (= 1 ~setEventCalled~0))) (or (and (= |old(~customIrp~0)| 1) .cse15 (= 0 ~customIrp~0) .cse16) (or .cse9 .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse14 .cse13 .cse7) (and .cse15 .cse16 .cse8))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse7 .cse4)))) [2018-11-23 02:03:39,688 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 7853 7896) the Hoare annotation is: (let ((.cse6 (not (= ~compRegistered~0 0))) (.cse5 (= ~NP~0 ~s~0)) (.cse9 (= 1 ~setEventCalled~0)) (.cse10 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (not (= |old(~setEventCalled~0)| 1))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (= ~PagingReferenceCount~0 1))) (.cse13 (not (= ~compRegistered~0 1))) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse14 (= ~IPC~0 ~MPR3~0)) (.cse7 (not (= 0 ~pended~0))) (.cse15 (= ~NP~0 ~MPR1~0)) (.cse8 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse5 .cse4 .cse6 .cse8) (or (and (= ~s~0 |old(~s~0)|) .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |old(~s~0)| ~MPR3~0)) (or .cse2 (or .cse0 .cse1 .cse4 .cse7 .cse8)))) (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) .cse10 .cse14 .cse15 (not (= |old(~customIrp~0)| 0))) (or (and .cse5 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse4 .cse14 .cse7 .cse15 .cse8)))) [2018-11-23 02:03:39,688 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 7822 7829) no Hoare annotation was computed. [2018-11-23 02:03:39,688 INFO L451 ceAbstractionStarter]: At program point KeReleaseSemaphoreENTRY(lines 7822 7829) the Hoare annotation is: true [2018-11-23 02:03:39,688 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 7822 7829) no Hoare annotation was computed. [2018-11-23 02:03:39,688 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadFINAL(lines 2187 2198) no Hoare annotation was computed. [2018-11-23 02:03:39,688 INFO L451 ceAbstractionStarter]: At program point FloppyUnloadENTRY(lines 2187 2198) the Hoare annotation is: true [2018-11-23 02:03:39,688 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadEXIT(lines 2187 2198) no Hoare annotation was computed. [2018-11-23 02:03:39,688 INFO L448 ceAbstractionStarter]: For program point L7756-1(lines 7748 7761) no Hoare annotation was computed. [2018-11-23 02:03:39,688 INFO L444 ceAbstractionStarter]: At program point L7756(line 7756) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse6 (not (= 0 ~pended~0))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse5 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse6 .cse3 (not (= ~compRegistered~0 1)) .cse4 .cse5) (or .cse1 .cse6 .cse3 .cse4 (not (= ~compRegistered~0 0)) .cse5))) [2018-11-23 02:03:39,697 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 7748 7761) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (= ~NP~0 ~s~0)) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1)) .cse6 .cse7) (or .cse1 .cse3 .cse4 .cse5 .cse6 (not (= ~compRegistered~0 0)) .cse7) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse4 .cse5 .cse6 .cse7))) [2018-11-23 02:03:39,697 INFO L448 ceAbstractionStarter]: For program point L7752(lines 7752 7758) no Hoare annotation was computed. [2018-11-23 02:03:39,697 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 7748 7761) no Hoare annotation was computed. [2018-11-23 02:03:39,697 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 02:03:39,697 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:03:39,697 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,697 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,697 INFO L451 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 1774 1778) the Hoare annotation is: true [2018-11-23 02:03:39,697 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 1774 1778) no Hoare annotation was computed. [2018-11-23 02:03:39,697 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 1774 1778) no Hoare annotation was computed. [2018-11-23 02:03:39,697 INFO L448 ceAbstractionStarter]: For program point L8116(lines 8099 8121) no Hoare annotation was computed. [2018-11-23 02:03:39,697 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 8099 8121) no Hoare annotation was computed. [2018-11-23 02:03:39,698 INFO L451 ceAbstractionStarter]: At program point L8106(lines 8105 8119) the Hoare annotation is: true [2018-11-23 02:03:39,698 INFO L451 ceAbstractionStarter]: At program point L8109(lines 8108 8118) the Hoare annotation is: true [2018-11-23 02:03:39,698 INFO L448 ceAbstractionStarter]: For program point L8105(lines 8105 8119) no Hoare annotation was computed. [2018-11-23 02:03:39,698 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8110 8117) no Hoare annotation was computed. [2018-11-23 02:03:39,698 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 8099 8121) the Hoare annotation is: true [2018-11-23 02:03:39,698 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8110 8117) no Hoare annotation was computed. [2018-11-23 02:03:39,698 INFO L444 ceAbstractionStarter]: At program point L3545-1(line 3545) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,705 INFO L444 ceAbstractionStarter]: At program point L3545(line 3545) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,705 INFO L444 ceAbstractionStarter]: At program point L3611-2(lines 3611 3633) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= FloppyStartDevice_~InterfaceType~0 0) .cse1 .cse2 .cse3) (and .cse0 (not (= FloppyStartDevice_~ntStatus~4 259)) .cse1 .cse2 .cse3))) [2018-11-23 02:03:39,706 INFO L444 ceAbstractionStarter]: At program point L3603(lines 3589 3636) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 02:03:39,706 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 3516 3677) no Hoare annotation was computed. [2018-11-23 02:03:39,706 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 3516 3677) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,706 INFO L444 ceAbstractionStarter]: At program point L3620(lines 3620 3623) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 02:03:39,706 INFO L448 ceAbstractionStarter]: For program point L3554(lines 3554 3561) no Hoare annotation was computed. [2018-11-23 02:03:39,706 INFO L448 ceAbstractionStarter]: For program point L3587-1(lines 3587 3669) no Hoare annotation was computed. [2018-11-23 02:03:39,706 INFO L448 ceAbstractionStarter]: For program point L3587(lines 3587 3669) no Hoare annotation was computed. [2018-11-23 02:03:39,706 INFO L448 ceAbstractionStarter]: For program point L3620-1(lines 3620 3623) no Hoare annotation was computed. [2018-11-23 02:03:39,713 INFO L448 ceAbstractionStarter]: For program point L3554-1(lines 3549 3562) no Hoare annotation was computed. [2018-11-23 02:03:39,713 INFO L448 ceAbstractionStarter]: For program point L3612(lines 3611 3633) no Hoare annotation was computed. [2018-11-23 02:03:39,713 INFO L448 ceAbstractionStarter]: For program point L3546(line 3546) no Hoare annotation was computed. [2018-11-23 02:03:39,713 INFO L448 ceAbstractionStarter]: For program point L3604(lines 3604 3608) no Hoare annotation was computed. [2018-11-23 02:03:39,713 INFO L448 ceAbstractionStarter]: For program point L3571-1(line 3571) no Hoare annotation was computed. [2018-11-23 02:03:39,713 INFO L448 ceAbstractionStarter]: For program point L3604-2(lines 3604 3608) no Hoare annotation was computed. [2018-11-23 02:03:39,713 INFO L444 ceAbstractionStarter]: At program point L3571(line 3571) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,713 INFO L444 ceAbstractionStarter]: At program point L3662(line 3662) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= 259 FloppyStartDevice_~ntStatus~4)) (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 02:03:39,713 INFO L444 ceAbstractionStarter]: At program point L3646(lines 3646 3647) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= 259 FloppyStartDevice_~ntStatus~4)) (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 02:03:39,714 INFO L448 ceAbstractionStarter]: For program point L3613(lines 3613 3617) no Hoare annotation was computed. [2018-11-23 02:03:39,714 INFO L448 ceAbstractionStarter]: For program point L3646-1(lines 3646 3647) no Hoare annotation was computed. [2018-11-23 02:03:39,714 INFO L448 ceAbstractionStarter]: For program point L3638(lines 3638 3644) no Hoare annotation was computed. [2018-11-23 02:03:39,714 INFO L448 ceAbstractionStarter]: For program point L3638-2(lines 3638 3644) no Hoare annotation was computed. [2018-11-23 02:03:39,714 INFO L444 ceAbstractionStarter]: At program point L3556(line 3556) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,714 INFO L448 ceAbstractionStarter]: For program point L3589(lines 3589 3636) no Hoare annotation was computed. [2018-11-23 02:03:39,714 INFO L448 ceAbstractionStarter]: For program point L3573(lines 3573 3580) no Hoare annotation was computed. [2018-11-23 02:03:39,714 INFO L448 ceAbstractionStarter]: For program point L3573-2(lines 3573 3580) no Hoare annotation was computed. [2018-11-23 02:03:39,714 INFO L448 ceAbstractionStarter]: For program point L3590(lines 3590 3601) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L448 ceAbstractionStarter]: For program point L3549(lines 3549 3562) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L448 ceAbstractionStarter]: For program point L3673-1(line 3673) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L444 ceAbstractionStarter]: At program point L3673(line 3673) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0))) (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= ~pended~0 1)) (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= ~compRegistered~0 1) (= 0 ~pended~0) .cse0 (= ~PagingReferenceCount~0 1))))) [2018-11-23 02:03:39,722 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 3516 3677) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L448 ceAbstractionStarter]: For program point L3649(lines 3649 3656) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L448 ceAbstractionStarter]: For program point L3649-2(lines 3649 3656) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L448 ceAbstractionStarter]: For program point L3575-1(line 3575) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L444 ceAbstractionStarter]: At program point L3575(line 3575) the Hoare annotation is: (let ((.cse6 (= 0 ~pended~0)) (.cse1 (<= FloppyStartDevice_~ntStatus~4 259)) (.cse5 (< 258 FloppyStartDevice_~ntStatus~4)) (.cse0 (= ~compRegistered~0 1)) (.cse2 (= 1 ~setEventCalled~0)) (.cse3 (= ~PagingReferenceCount~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0))) (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= ~MPR3~0 ~s~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse6 .cse1 .cse5 .cse0 (= ~NP~0 ~s~0) .cse2 .cse3 .cse4))) [2018-11-23 02:03:39,722 INFO L444 ceAbstractionStarter]: At program point L3592(line 3592) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 02:03:39,722 INFO L448 ceAbstractionStarter]: For program point L3625(lines 3625 3631) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L448 ceAbstractionStarter]: For program point L3592-1(line 3592) no Hoare annotation was computed. [2018-11-23 02:03:39,722 INFO L444 ceAbstractionStarter]: At program point L3584(lines 3584 3585) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (and (and (= ~compRegistered~0 1) (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~PagingReferenceCount~0 1)) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,722 INFO L444 ceAbstractionStarter]: At program point L3551(line 3551) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:03:39,729 INFO L448 ceAbstractionStarter]: For program point L3584-1(lines 3584 3585) no Hoare annotation was computed. [2018-11-23 02:03:39,729 INFO L444 ceAbstractionStarter]: At program point L3634(lines 3587 3667) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= 259 FloppyStartDevice_~ntStatus~4)) (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 02:03:39,729 INFO L448 ceAbstractionStarter]: For program point L3651-1(lines 3651 3652) no Hoare annotation was computed. [2018-11-23 02:03:39,729 INFO L444 ceAbstractionStarter]: At program point L3651(lines 3651 3652) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)))) [2018-11-23 02:03:39,729 INFO L448 ceAbstractionStarter]: For program point L3594(lines 3594 3598) no Hoare annotation was computed. [2018-11-23 02:03:39,729 INFO L448 ceAbstractionStarter]: For program point L7995(lines 7979 8000) no Hoare annotation was computed. [2018-11-23 02:03:39,729 INFO L451 ceAbstractionStarter]: At program point L7988(lines 7987 7997) the Hoare annotation is: true [2018-11-23 02:03:39,729 INFO L448 ceAbstractionStarter]: For program point L7984(lines 7984 7998) no Hoare annotation was computed. [2018-11-23 02:03:39,729 INFO L451 ceAbstractionStarter]: At program point L7985(lines 7984 7998) the Hoare annotation is: true [2018-11-23 02:03:39,730 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 7979 8000) no Hoare annotation was computed. [2018-11-23 02:03:39,730 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 7979 8000) the Hoare annotation is: true [2018-11-23 02:03:39,730 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7989 7996) no Hoare annotation was computed. [2018-11-23 02:03:39,730 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7989 7996) no Hoare annotation was computed. [2018-11-23 02:03:39,730 INFO L448 ceAbstractionStarter]: For program point L8210(lines 8194 8215) no Hoare annotation was computed. [2018-11-23 02:03:39,730 INFO L451 ceAbstractionStarter]: At program point L8203(lines 8202 8212) the Hoare annotation is: true [2018-11-23 02:03:39,730 INFO L448 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 8194 8215) no Hoare annotation was computed. [2018-11-23 02:03:39,730 INFO L448 ceAbstractionStarter]: For program point L8199(lines 8199 8213) no Hoare annotation was computed. [2018-11-23 02:03:39,730 INFO L451 ceAbstractionStarter]: At program point L8200(lines 8199 8213) the Hoare annotation is: true [2018-11-23 02:03:39,730 INFO L451 ceAbstractionStarter]: At program point RtlDeleteRegistryValueENTRY(lines 8194 8215) the Hoare annotation is: true [2018-11-23 02:03:39,730 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8204 8211) no Hoare annotation was computed. [2018-11-23 02:03:39,732 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8204 8211) no Hoare annotation was computed. [2018-11-23 02:03:39,732 INFO L448 ceAbstractionStarter]: For program point L7410(lines 7387 7415) no Hoare annotation was computed. [2018-11-23 02:03:39,732 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 7387 7415) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= ~s~0 ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0))) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-23 02:03:39,732 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 7387 7415) no Hoare annotation was computed. [2018-11-23 02:03:39,732 INFO L451 ceAbstractionStarter]: At program point L7400(lines 7399 7412) the Hoare annotation is: true [2018-11-23 02:03:39,732 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7401 7411) no Hoare annotation was computed. [2018-11-23 02:03:39,732 INFO L448 ceAbstractionStarter]: For program point L7396(lines 7396 7413) no Hoare annotation was computed. [2018-11-23 02:03:39,732 INFO L451 ceAbstractionStarter]: At program point L7397(lines 7396 7413) the Hoare annotation is: true [2018-11-23 02:03:39,732 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7401 7411) no Hoare annotation was computed. [2018-11-23 02:03:39,732 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 7841 7848) the Hoare annotation is: true [2018-11-23 02:03:39,732 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 7841 7848) no Hoare annotation was computed. [2018-11-23 02:03:39,732 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 7841 7848) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 7027 7040) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 7027 7040) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= ~PagingReferenceCount~0 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,733 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 7027 7040) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L448 ceAbstractionStarter]: For program point L2179-2(lines 2179 2183) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L448 ceAbstractionStarter]: For program point L2174(lines 2174 2178) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L448 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2142 2186) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L448 ceAbstractionStarter]: For program point L2174-2(lines 2174 2178) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L448 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2142 2186) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L451 ceAbstractionStarter]: At program point DriverEntryENTRY(lines 2142 2186) the Hoare annotation is: true [2018-11-23 02:03:39,733 INFO L448 ceAbstractionStarter]: For program point L2163(lines 2163 2167) no Hoare annotation was computed. [2018-11-23 02:03:39,733 INFO L451 ceAbstractionStarter]: At program point L2160(line 2160) the Hoare annotation is: true [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point L2160-1(line 2160) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point L2179(lines 2179 2183) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 02:03:39,737 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 2095 2101) the Hoare annotation is: true [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 2095 2101) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 2095 2101) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2099) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point L8254(lines 8254 8268) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L451 ceAbstractionStarter]: At program point L8255(lines 8254 8268) the Hoare annotation is: true [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 8248 8270) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L451 ceAbstractionStarter]: At program point RtlQueryRegistryValuesENTRY(lines 8248 8270) the Hoare annotation is: true [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point L8265(lines 8248 8270) no Hoare annotation was computed. [2018-11-23 02:03:39,737 INFO L451 ceAbstractionStarter]: At program point L8258(lines 8257 8267) the Hoare annotation is: true [2018-11-23 02:03:39,737 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8259 8266) no Hoare annotation was computed. [2018-11-23 02:03:39,738 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8259 8266) no Hoare annotation was computed. [2018-11-23 02:03:39,738 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:03:39,738 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 02:03:39,738 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,738 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,738 INFO L444 ceAbstractionStarter]: At program point L7703(lines 7702 7717) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (= ~SKIP1~0 ~s~0)) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse5 (= ~SKIP2~0 ~DC~0))) (and (or (and (= ~s~0 ~MPR1~0) (<= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0) (< 0 (+ IofCallDriver_~compRetStatus1~0 1073741803)) (= 1 ~setEventCalled~0)) (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse4 (= ~IPC~0 ~MPR3~0) .cse5))) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse3 .cse8 .cse5) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse8 .cse4 .cse6 .cse7 .cse5))) [2018-11-23 02:03:39,741 INFO L448 ceAbstractionStarter]: For program point L7699(lines 7699 7718) no Hoare annotation was computed. [2018-11-23 02:03:39,741 INFO L448 ceAbstractionStarter]: For program point L7724(lines 7724 7741) no Hoare annotation was computed. [2018-11-23 02:03:39,741 INFO L448 ceAbstractionStarter]: For program point L7683-1(line 7683) no Hoare annotation was computed. [2018-11-23 02:03:39,741 INFO L444 ceAbstractionStarter]: At program point L7683(line 7683) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse7) (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse6 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)) (= ~NP~0 ~s~0)))) [2018-11-23 02:03:39,741 INFO L444 ceAbstractionStarter]: At program point L7700(lines 7699 7718) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (= ~SKIP1~0 ~s~0)) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse5 (= ~SKIP2~0 ~DC~0))) (and (or (and (= ~s~0 ~MPR1~0) (<= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0) (< 0 (+ IofCallDriver_~compRetStatus1~0 1073741803)) (= 1 ~setEventCalled~0)) (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse4 (= ~IPC~0 ~MPR3~0) .cse5))) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse3 .cse8 .cse5) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse8 .cse4 .cse6 .cse7 .cse5))) [2018-11-23 02:03:39,741 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 7672 7745) the Hoare annotation is: (let ((.cse7 (= ~SKIP1~0 ~s~0)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse8 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse7 .cse3 .cse4 .cse5 .cse8) (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse6 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse8)) (= ~NP~0 ~s~0)))) [2018-11-23 02:03:39,741 INFO L448 ceAbstractionStarter]: For program point L7733(lines 7733 7740) no Hoare annotation was computed. [2018-11-23 02:03:39,741 INFO L448 ceAbstractionStarter]: For program point L7725(lines 7725 7731) no Hoare annotation was computed. [2018-11-23 02:03:39,741 INFO L444 ceAbstractionStarter]: At program point L7688(line 7688) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse5 (= ~SKIP2~0 ~DC~0))) (and (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse4 (= ~IPC~0 ~MPR3~0) .cse5)) (and (<= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0) (= ~NP~0 ~s~0) (< 0 (+ IofCallDriver_~compRetStatus1~0 1073741803)) (= 1 ~setEventCalled~0))) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse3 .cse5) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse4 .cse6 .cse7 .cse5))) [2018-11-23 02:03:39,750 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 7672 7745) no Hoare annotation was computed. [2018-11-23 02:03:39,751 INFO L444 ceAbstractionStarter]: At program point L7738(line 7738) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse7) (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse6 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)))) [2018-11-23 02:03:39,751 INFO L448 ceAbstractionStarter]: For program point L7738-1(lines 7720 7742) no Hoare annotation was computed. [2018-11-23 02:03:39,751 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 7672 7745) no Hoare annotation was computed. [2018-11-23 02:03:39,751 INFO L444 ceAbstractionStarter]: At program point L7697(lines 7696 7719) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (= ~SKIP1~0 ~s~0)) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse5 (= ~SKIP2~0 ~DC~0))) (and (or (and (= ~s~0 ~MPR1~0) (<= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0) (< 0 (+ IofCallDriver_~compRetStatus1~0 1073741803)) (= 1 ~setEventCalled~0)) (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse4 (= ~IPC~0 ~MPR3~0) .cse5))) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse3 .cse8 .cse5) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse8 .cse4 .cse6 .cse7 .cse5))) [2018-11-23 02:03:39,751 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 7704 7716) no Hoare annotation was computed. [2018-11-23 02:03:39,751 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 7704 7716) no Hoare annotation was computed. [2018-11-23 02:03:39,751 INFO L448 ceAbstractionStarter]: For program point L7681-1(lines 7680 7744) no Hoare annotation was computed. [2018-11-23 02:03:39,751 INFO L448 ceAbstractionStarter]: For program point L7681(lines 7681 7695) no Hoare annotation was computed. [2018-11-23 02:03:39,751 INFO L448 ceAbstractionStarter]: For program point L7686(lines 7686 7692) no Hoare annotation was computed. [2018-11-23 02:03:39,751 INFO L444 ceAbstractionStarter]: At program point L7715(lines 7680 7744) the Hoare annotation is: (let ((.cse7 (= ~SKIP1~0 ~s~0)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse8 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse7 .cse3 .cse4 .cse5 .cse8) (let ((.cse9 (= ~s~0 ~MPR1~0)) (.cse10 (<= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0)) (.cse11 (< 0 (+ IofCallDriver_~compRetStatus1~0 1073741803))) (.cse12 (= 1 ~setEventCalled~0))) (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse6 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse8)) (and .cse9 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse10 .cse11 .cse12) (and .cse9 .cse10 .cse11 .cse12 (= IofCallDriver_~returnVal2~0 259)) (and .cse9 .cse10 (= 0 IofCallDriver_~returnVal2~0) .cse11 .cse12))))) [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point L2620(lines 2620 2626) no Hoare annotation was computed. [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point L2620-2(lines 2620 2626) no Hoare annotation was computed. [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point L2614(lines 2614 2634) no Hoare annotation was computed. [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 2557 2666) no Hoare annotation was computed. [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point L2641(lines 2641 2645) no Hoare annotation was computed. [2018-11-23 02:03:39,755 INFO L444 ceAbstractionStarter]: At program point L2662(line 2662) the Hoare annotation is: (let ((.cse2 (= ~SKIP1~0 ~NP~0)) (.cse3 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= ~s~0 ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse1 (= ~SKIP2~0 ~DC~0)) (.cse5 (= ~pended~0 1))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~PagingReferenceCount~0)| 1)) .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or .cse2 .cse3 .cse0 .cse4 (and .cse5 (= ~PagingReferenceCount~0 0)) .cse6 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) .cse1 (and .cse5 (= ~PagingReferenceCount~0 1))))) [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point L2596(lines 2596 2602) no Hoare annotation was computed. [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point L2660(lines 2660 2661) no Hoare annotation was computed. [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point L2662-1(line 2662) no Hoare annotation was computed. [2018-11-23 02:03:39,755 INFO L448 ceAbstractionStarter]: For program point L2596-2(lines 2596 2602) no Hoare annotation was computed. [2018-11-23 02:03:39,756 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 2557 2666) the Hoare annotation is: (let ((.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (= ~SKIP2~0 ~DC~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse3 (not (= ~s~0 ~NP~0))) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse7 (= 0 ~pended~0)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse7 (= ~PagingReferenceCount~0 0)) .cse8) (or .cse2 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse8 .cse0 .cse1 .cse3 (not (= |old(~PagingReferenceCount~0)| 1)) .cse4 (and .cse7 (= ~PagingReferenceCount~0 1)) .cse5 .cse6 (not (= ~customIrp~0 0))))) [2018-11-23 02:03:39,756 INFO L444 ceAbstractionStarter]: At program point L2656(line 2656) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (not (= ~s~0 ~NP~0))) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~PagingReferenceCount~0)| 0)) .cse7) (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~PagingReferenceCount~0)| 1)) .cse4 (= ~IPC~0 ~MPR3~0) .cse5 .cse6 (= ~NP~0 ~MPR1~0) .cse7 (not (= ~customIrp~0 0))))) [2018-11-23 02:03:39,766 INFO L448 ceAbstractionStarter]: For program point L2590(lines 2590 2650) no Hoare annotation was computed. [2018-11-23 02:03:39,766 INFO L444 ceAbstractionStarter]: At program point L2656-1(lines 2652 2658) the Hoare annotation is: (let ((.cse2 (= ~SKIP1~0 ~NP~0)) (.cse3 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= ~s~0 ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse1 (= ~SKIP2~0 ~DC~0)) (.cse5 (= ~pended~0 1))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~PagingReferenceCount~0)| 1)) .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or .cse2 .cse3 .cse0 .cse4 (and .cse5 (= ~PagingReferenceCount~0 0)) .cse6 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) .cse1 (and .cse5 (= ~PagingReferenceCount~0 1))))) [2018-11-23 02:03:39,766 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 2557 2666) no Hoare annotation was computed. [2018-11-23 02:03:39,766 INFO L448 ceAbstractionStarter]: For program point L2590-2(lines 2590 2650) no Hoare annotation was computed. [2018-11-23 02:03:39,767 INFO L448 ceAbstractionStarter]: For program point L2652(lines 2652 2658) no Hoare annotation was computed. [2018-11-23 02:03:39,767 INFO L448 ceAbstractionStarter]: For program point L2611-1(lines 2611 2612) no Hoare annotation was computed. [2018-11-23 02:03:39,767 INFO L444 ceAbstractionStarter]: At program point L2611(lines 2611 2612) the Hoare annotation is: (let ((.cse3 (= ~SKIP1~0 ~NP~0)) (.cse4 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse2 (= 0 ~pended~0)) (.cse1 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 (and .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) .cse3 .cse4 .cse5 (not (= |old(~PagingReferenceCount~0)| 1)) .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse2 (= ~PagingReferenceCount~0 1)) .cse1))) [2018-11-23 02:03:39,767 INFO L444 ceAbstractionStarter]: At program point L2638(line 2638) the Hoare annotation is: (let ((.cse3 (= ~SKIP1~0 ~NP~0)) (.cse4 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse2 (= 0 ~pended~0)) (.cse1 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 (and .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) .cse3 .cse4 .cse5 (not (= |old(~PagingReferenceCount~0)| 1)) .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse2 (= ~PagingReferenceCount~0 1)) .cse1))) [2018-11-23 02:03:39,767 INFO L444 ceAbstractionStarter]: At program point L2636(lines 2636 2637) the Hoare annotation is: (let ((.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (= ~SKIP2~0 ~DC~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse3 (not (= ~s~0 ~NP~0))) (.cse7 (= 0 ~pended~0)) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse7 (= ~PagingReferenceCount~0 1)) .cse8) (or .cse2 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse8 .cse0 .cse1 .cse3 (not (= |old(~PagingReferenceCount~0)| 1)) (and .cse7 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) .cse4 .cse5 .cse6 (not (= ~customIrp~0 0))))) [2018-11-23 02:03:39,778 INFO L448 ceAbstractionStarter]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2018-11-23 02:03:39,778 INFO L448 ceAbstractionStarter]: For program point L2636-1(lines 2636 2637) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2568(lines 2568 2580) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2942(lines 2941 2959) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2876(lines 2876 2903) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L444 ceAbstractionStarter]: At program point L2992(lines 2992 2993) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2992-1(lines 2992 2993) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2893(lines 2893 2898) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L444 ceAbstractionStarter]: At program point L2761(lines 2760 3127) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2943(lines 2943 2947) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2877(lines 2877 2882) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2778(lines 2778 3121) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L448 ceAbstractionStarter]: For program point L2745-1(lines 2741 2747) no Hoare annotation was computed. [2018-11-23 02:03:39,779 INFO L444 ceAbstractionStarter]: At program point L2745(line 2745) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0))) [2018-11-23 02:03:39,779 INFO L444 ceAbstractionStarter]: At program point L3092(line 3092) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,791 INFO L448 ceAbstractionStarter]: For program point L3092-1(line 3092) no Hoare annotation was computed. [2018-11-23 02:03:39,791 INFO L448 ceAbstractionStarter]: For program point L2729(lines 2729 2739) no Hoare annotation was computed. [2018-11-23 02:03:39,791 INFO L448 ceAbstractionStarter]: For program point L3142(lines 3142 3158) no Hoare annotation was computed. [2018-11-23 02:03:39,791 INFO L448 ceAbstractionStarter]: For program point L3109-1(lines 3109 3110) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L444 ceAbstractionStarter]: At program point L3109(lines 3109 3110) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L2911(line 2911) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L2713(lines 2713 2725) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L2713-2(lines 2713 2725) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L444 ceAbstractionStarter]: At program point L2994(lines 2994 2995) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L2994-1(lines 2994 2995) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L2763(lines 2763 3126) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L444 ceAbstractionStarter]: At program point L3077(lines 2790 3117) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L2714(lines 2714 2722) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L2830(lines 2830 2835) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 2682 3180) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L3078(lines 3078 3097) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L448 ceAbstractionStarter]: For program point L2847-1(lines 2847 2848) no Hoare annotation was computed. [2018-11-23 02:03:39,792 INFO L444 ceAbstractionStarter]: At program point L2847(lines 2847 2848) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L2781(lines 2781 3120) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L3029(lines 3029 3045) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L2930(lines 2930 2937) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L2930-2(lines 2930 2937) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L3145(lines 3145 3157) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L444 ceAbstractionStarter]: At program point L2980(lines 2980 2981) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L2980-1(lines 2980 2981) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L2815-1(lines 2815 2816) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L444 ceAbstractionStarter]: At program point L2815(lines 2815 2816) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,804 INFO L444 ceAbstractionStarter]: At program point L2716(line 2716) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L2716-1(line 2716) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L3129(lines 3129 3177) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L448 ceAbstractionStarter]: For program point L3063-1(lines 3063 3064) no Hoare annotation was computed. [2018-11-23 02:03:39,804 INFO L444 ceAbstractionStarter]: At program point L3063(lines 3063 3064) the Hoare annotation is: (or (and (= 0 ~pended~0) (= FloppyDeviceControl_~ntStatus~2 0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,805 INFO L448 ceAbstractionStarter]: For program point L2964(lines 2964 3076) no Hoare annotation was computed. [2018-11-23 02:03:39,805 INFO L448 ceAbstractionStarter]: For program point L2766(lines 2766 3125) no Hoare annotation was computed. [2018-11-23 02:03:39,805 INFO L448 ceAbstractionStarter]: For program point L2799(lines 2799 2804) no Hoare annotation was computed. [2018-11-23 02:03:39,808 INFO L448 ceAbstractionStarter]: For program point L2849-1(lines 2849 2850) no Hoare annotation was computed. [2018-11-23 02:03:39,808 INFO L444 ceAbstractionStarter]: At program point L2849(lines 2849 2850) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,808 INFO L444 ceAbstractionStarter]: At program point L2866(line 2866) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,808 INFO L448 ceAbstractionStarter]: For program point L2866-1(line 2866) no Hoare annotation was computed. [2018-11-23 02:03:39,808 INFO L444 ceAbstractionStarter]: At program point L2734(line 2734) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,808 INFO L444 ceAbstractionStarter]: At program point L2767(lines 2763 3126) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,808 INFO L448 ceAbstractionStarter]: For program point L2734-1(line 2734) no Hoare annotation was computed. [2018-11-23 02:03:39,809 INFO L444 ceAbstractionStarter]: At program point L3114(lines 2705 3179) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0))) (or (and .cse0 (= ~pended~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0))) (and (= 0 ~pended~0) .cse0 (not (= 259 FloppyDeviceControl_~ntStatus~2))))) [2018-11-23 02:03:39,809 INFO L448 ceAbstractionStarter]: For program point L3081(lines 3081 3088) no Hoare annotation was computed. [2018-11-23 02:03:39,809 INFO L448 ceAbstractionStarter]: For program point L3015(lines 3015 3047) no Hoare annotation was computed. [2018-11-23 02:03:39,809 INFO L448 ceAbstractionStarter]: For program point L2784(lines 2784 3119) no Hoare annotation was computed. [2018-11-23 02:03:39,809 INFO L448 ceAbstractionStarter]: For program point L2817-1(lines 2817 2818) no Hoare annotation was computed. [2018-11-23 02:03:39,809 INFO L444 ceAbstractionStarter]: At program point L2817(lines 2817 2818) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,809 INFO L448 ceAbstractionStarter]: For program point L2751-1(line 2751) no Hoare annotation was computed. [2018-11-23 02:03:39,809 INFO L444 ceAbstractionStarter]: At program point L2751(line 2751) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,814 INFO L444 ceAbstractionStarter]: At program point L3098(lines 2793 3116) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,814 INFO L448 ceAbstractionStarter]: For program point L2999-1(line 2999) no Hoare annotation was computed. [2018-11-23 02:03:39,814 INFO L444 ceAbstractionStarter]: At program point L2999(line 2999) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,814 INFO L448 ceAbstractionStarter]: For program point L3148(lines 3148 3156) no Hoare annotation was computed. [2018-11-23 02:03:39,814 INFO L444 ceAbstractionStarter]: At program point L2785(lines 2781 3120) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,814 INFO L448 ceAbstractionStarter]: For program point L3132(lines 3132 3171) no Hoare annotation was computed. [2018-11-23 02:03:39,814 INFO L444 ceAbstractionStarter]: At program point L3066(lines 3066 3067) the Hoare annotation is: (or (and (= 0 ~pended~0) (= FloppyDeviceControl_~ntStatus~2 0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,814 INFO L444 ceAbstractionStarter]: At program point L3132-1(lines 3132 3171) the Hoare annotation is: (let ((.cse0 (= ~s~0 |old(~s~0)|))) (or (and (and (= 0 ~pended~0) .cse0) (not (= 259 FloppyDeviceControl_~ntStatus~2))) (and .cse0 (= ~pended~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0))))) [2018-11-23 02:03:39,814 INFO L444 ceAbstractionStarter]: At program point L3066-1(lines 3066 3067) the Hoare annotation is: (or (and (= 0 ~pended~0) (= FloppyDeviceControl_~ntStatus~2 0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,814 INFO L448 ceAbstractionStarter]: For program point L2967(lines 2967 2972) no Hoare annotation was computed. [2018-11-23 02:03:39,814 INFO L448 ceAbstractionStarter]: For program point L2868(lines 2868 2875) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L2868-1(lines 2868 2875) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L2769(lines 2769 3124) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point $Ultimate##38(lines 2795 3115) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point $Ultimate##37(lines 2795 3115) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L2984(lines 2984 2989) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L2885(lines 2885 2900) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L3133(lines 3133 3161) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L2787(lines 2787 3118) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L3068(lines 3068 3069) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L3151(lines 3151 3155) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 2682 3180) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L3052(lines 3052 3061) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L3151-2(lines 3132 3169) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L444 ceAbstractionStarter]: At program point L2788(lines 2787 3118) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L3036(lines 3036 3044) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L3003-1(lines 3003 3005) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L444 ceAbstractionStarter]: At program point L3003(lines 3003 3005) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,827 INFO L444 ceAbstractionStarter]: At program point L2904(lines 2769 3124) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L2772(lines 2772 3123) no Hoare annotation was computed. [2018-11-23 02:03:39,827 INFO L448 ceAbstractionStarter]: For program point L2921(lines 2921 2928) no Hoare annotation was computed. [2018-11-23 02:03:39,828 INFO L448 ceAbstractionStarter]: For program point L3136(lines 3136 3160) no Hoare annotation was computed. [2018-11-23 02:03:39,835 INFO L448 ceAbstractionStarter]: For program point L3103-1(lines 3099 3105) no Hoare annotation was computed. [2018-11-23 02:03:39,835 INFO L444 ceAbstractionStarter]: At program point L3103(line 3103) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0))) [2018-11-23 02:03:39,835 INFO L448 ceAbstractionStarter]: For program point L2839(lines 2839 2845) no Hoare annotation was computed. [2018-11-23 02:03:39,835 INFO L448 ceAbstractionStarter]: For program point L2740(lines 2740 2756) no Hoare annotation was computed. [2018-11-23 02:03:39,835 INFO L444 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 2682 3180) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,835 INFO L448 ceAbstractionStarter]: For program point L2889(lines 2889 2899) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L2790(lines 2790 3117) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L2757(lines 2757 3128) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L2807(lines 2807 2813) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L2741(lines 2741 2747) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L3022(lines 3022 3046) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L2857(lines 2857 2864) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L444 ceAbstractionStarter]: At program point L2758(lines 2757 3128) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L2973(lines 2973 2978) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L2775(lines 2775 3122) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L3139(lines 3139 3159) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L3007(lines 3007 3014) no Hoare annotation was computed. [2018-11-23 02:03:39,836 INFO L444 ceAbstractionStarter]: At program point L2941-2(lines 2941 2959) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~NP~0 ~s~0))) (or (and .cse0 .cse1 (= 0 FloppyDeviceControl_~ntStatus~2)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0))) (and .cse0 (<= (+ FloppyDeviceControl_~ntStatus~2 2147483643) 0) .cse1))) [2018-11-23 02:03:39,836 INFO L448 ceAbstractionStarter]: For program point L2991-1(line 2991) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L444 ceAbstractionStarter]: At program point L2991(line 2991) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0)))) [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L2826(lines 2826 2836) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L2760(lines 2760 3127) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6497(lines 6497 6505) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6456-1(lines 6455 6463) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6481(lines 6481 6514) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6494(lines 6494 6506) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L451 ceAbstractionStarter]: At program point L6453-2(lines 6453 6465) the Hoare annotation is: true [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6478(lines 6478 6515) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L451 ceAbstractionStarter]: At program point L6466(lines 6452 6467) the Hoare annotation is: true [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6491(lines 6491 6507) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 6446 6520) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6454(line 6454) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6487(lines 6487 6511) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6487-2(lines 6487 6511) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6475(lines 6475 6516) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6500(lines 6500 6504) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 6446 6520) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6455(lines 6455 6463) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6488(lines 6488 6508) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L448 ceAbstractionStarter]: For program point L6484(lines 6484 6513) no Hoare annotation was computed. [2018-11-23 02:03:39,849 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 6446 6520) the Hoare annotation is: true [2018-11-23 02:03:39,850 INFO L448 ceAbstractionStarter]: For program point L6472(lines 6472 6517) no Hoare annotation was computed. [2018-11-23 02:03:39,850 INFO L448 ceAbstractionStarter]: For program point L6468(lines 6468 6518) no Hoare annotation was computed. [2018-11-23 02:03:39,850 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,856 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-23 02:03:39,856 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 10 15) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L451 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 10 15) the Hoare annotation is: true [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 10 15) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L444 ceAbstractionStarter]: At program point L6784-2(lines 6784 6790) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point L6784(lines 6784 6790) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 6774 6845) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L444 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 6774 6845) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point L6810(lines 6810 6816) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L444 ceAbstractionStarter]: At program point L6806(line 6806) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point L6810-2(lines 6810 6816) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 6774 6845) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point L6806-1(line 6806) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point L6837(lines 6837 6838) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L444 ceAbstractionStarter]: At program point L6798(line 6798) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,857 INFO L448 ceAbstractionStarter]: For program point L6800(lines 6800 6823) no Hoare annotation was computed. [2018-11-23 02:03:39,857 INFO L444 ceAbstractionStarter]: At program point L6833-1(lines 6829 6835) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (= ~pended~0 1) (= ~PagingReferenceCount~0 1))) [2018-11-23 02:03:39,870 INFO L444 ceAbstractionStarter]: At program point L6833(line 6833) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6794(line 6794) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6796-1(lines 6796 6842) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6796(lines 6796 6842) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6798-1(line 6798) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6829(lines 6829 6835) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L444 ceAbstractionStarter]: At program point L6825(lines 6796 6842) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (= ~SKIP2~0 ~DC~0)) [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6591(lines 6591 6597) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6588-1(lines 6588 6589) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L444 ceAbstractionStarter]: At program point L6588(lines 6588 6589) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0))) (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,871 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 6576 6613) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0))) (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 6576 6613) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6603(lines 6603 6610) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point L6605-1(line 6605) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 6576 6613) no Hoare annotation was computed. [2018-11-23 02:03:39,871 INFO L444 ceAbstractionStarter]: At program point L6605(line 6605) the Hoare annotation is: (let ((.cse1 (= 1 ~setEventCalled~0)) (.cse0 (= 259 FlFdcDeviceIo_~ntStatus~16))) (or (and .cse0 (= ~NP~0 ~s~0) .cse1) (and (and (= ~MPR3~0 ~s~0) .cse1) .cse0) (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point L6601-1(line 6601) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L444 ceAbstractionStarter]: At program point L6601(line 6601) the Hoare annotation is: (or (= ~NP~0 ~s~0) (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point L6603-2(lines 6603 6610) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 7237 7249) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 7237 7249) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L451 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 7237 7249) the Hoare annotation is: true [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point L2494(lines 2494 2538) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 2483 2556) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L451 ceAbstractionStarter]: At program point L2507(lines 2506 2534) the Hoare annotation is: true [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point L2503(lines 2503 2535) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 2511 2532) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L451 ceAbstractionStarter]: At program point L2501(lines 2500 2536) the Hoare annotation is: true [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point $Ultimate##13(lines 2511 2532) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point L2497(lines 2497 2537) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L451 ceAbstractionStarter]: At program point L2495(lines 2494 2538) the Hoare annotation is: true [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point L2489(lines 2489 2493) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L451 ceAbstractionStarter]: At program point L2510(lines 2509 2533) the Hoare annotation is: true [2018-11-23 02:03:39,887 INFO L448 ceAbstractionStarter]: For program point L2506(lines 2506 2534) no Hoare annotation was computed. [2018-11-23 02:03:39,887 INFO L451 ceAbstractionStarter]: At program point L2504(lines 2503 2535) the Hoare annotation is: true [2018-11-23 02:03:39,887 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 2483 2556) the Hoare annotation is: true [2018-11-23 02:03:39,888 INFO L448 ceAbstractionStarter]: For program point L2500(lines 2500 2536) no Hoare annotation was computed. [2018-11-23 02:03:39,888 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 2483 2556) no Hoare annotation was computed. [2018-11-23 02:03:39,888 INFO L451 ceAbstractionStarter]: At program point L2498(lines 2497 2537) the Hoare annotation is: true [2018-11-23 02:03:39,903 INFO L451 ceAbstractionStarter]: At program point L2531(lines 2511 2532) the Hoare annotation is: true [2018-11-23 02:03:39,903 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,903 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~NP~0 ~MPR1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~PagingReferenceCount~0 0) (= ~SKIP1~0 ~s~0)) [2018-11-23 02:03:39,903 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:03:39,903 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:03:39,903 INFO L448 ceAbstractionStarter]: For program point L7583(lines 7555 7588) no Hoare annotation was computed. [2018-11-23 02:03:39,903 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 7555 7588) no Hoare annotation was computed. [2018-11-23 02:03:39,903 INFO L451 ceAbstractionStarter]: At program point L7576(lines 7575 7585) the Hoare annotation is: true [2018-11-23 02:03:39,903 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 7555 7588) the Hoare annotation is: true [2018-11-23 02:03:39,903 INFO L448 ceAbstractionStarter]: For program point L7572(lines 7572 7586) no Hoare annotation was computed. [2018-11-23 02:03:39,903 INFO L451 ceAbstractionStarter]: At program point L7573(lines 7572 7586) the Hoare annotation is: true [2018-11-23 02:03:39,903 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7577 7584) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7577 7584) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L451 ceAbstractionStarter]: At program point L7486(lines 7485 7499) the Hoare annotation is: true [2018-11-23 02:03:39,904 INFO L451 ceAbstractionStarter]: At program point L7489(lines 7488 7498) the Hoare annotation is: true [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point L7485(lines 7485 7499) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 7481 7501) the Hoare annotation is: true [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 7481 7501) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point L7496(lines 7481 7501) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7490 7497) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7490 7497) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point L8287(lines 8272 8292) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 8272 8292) the Hoare annotation is: true [2018-11-23 02:03:39,904 INFO L451 ceAbstractionStarter]: At program point L8280(lines 8279 8289) the Hoare annotation is: true [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point L8276(lines 8276 8290) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 8272 8292) no Hoare annotation was computed. [2018-11-23 02:03:39,904 INFO L451 ceAbstractionStarter]: At program point L8277(lines 8276 8290) the Hoare annotation is: true [2018-11-23 02:03:39,911 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8281 8288) no Hoare annotation was computed. [2018-11-23 02:03:39,912 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8281 8288) no Hoare annotation was computed. [2018-11-23 02:03:39,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:03:39 BoogieIcfgContainer [2018-11-23 02:03:39,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:03:39,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:03:39,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:03:39,979 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:03:39,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:53" (3/4) ... [2018-11-23 02:03:39,984 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:03:39,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoGetConfigurationInformation [2018-11-23 02:03:39,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-23 02:03:39,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-23 02:03:39,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyReadWrite [2018-11-23 02:03:39,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-23 02:03:39,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedInsertTailList [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedRemoveHeadList [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPower [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeReleaseSemaphore [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyUnload [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-11-23 02:03:39,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedExchange [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlDeleteRegistryValue [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DriverEntry [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlQueryRegistryValues [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-23 02:03:39,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_guard [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-23 02:03:39,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-23 02:03:40,044 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1157 nodes and edges [2018-11-23 02:03:40,048 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 585 nodes and edges [2018-11-23 02:03:40,052 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 276 nodes and edges [2018-11-23 02:03:40,055 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2018-11-23 02:03:40,058 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2018-11-23 02:03:40,061 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-11-23 02:03:40,064 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 02:03:40,067 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 02:03:40,072 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 02:03:40,107 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && pended == 1) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || s == UNLOADED) || ((((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == pended) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((compRegistered == 1 && !(MPR1 == SKIP1)) && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(compRegistered) == 0)) || (((((0 == pended && !(SKIP2 == s)) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((0 == pended && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((0 == status + 1073741738 && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,108 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 == status && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (0 == status + 1073741738 && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || (((((compRegistered == 1 && !(MPR1 == SKIP1)) && !(SKIP1 == NP)) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) || (((!(MPR1 == SKIP1) && 0 == compRegistered) && !(SKIP1 == NP)) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) && !(259 == status))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (0 == status + 2147483631 && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (((!(MPR1 == SKIP1) && pended == 1) && !(SKIP1 == NP)) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,108 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((!(SKIP2 == s) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(DC))) || ((((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(\old(compRegistered) == 0)) || (!(259 == status) && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || ((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP)))) || (0 == compRegistered && ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || ((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))))))) || (((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (s == SKIP2 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || ((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))))) || ((((0 == status + 1073741738 && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || ((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))) && pended == 1)) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC) && ((NP == s && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC)) && (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || \old(customIrp) == customIrp) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && (((((\old(customIrp) == 1 && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 0 == customIrp) && 1 == setEventCalled) || ((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || (((((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s) [2018-11-23 02:03:40,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC) && ((NP == s && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC)) && (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || \old(customIrp) == customIrp) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && (((((\old(customIrp) == 1 && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 0 == customIrp) && 1 == setEventCalled) || ((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || (((((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s) [2018-11-23 02:03:40,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC [2018-11-23 02:03:40,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled) || NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || SKIP1 == s) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) [2018-11-23 02:03:40,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) [2018-11-23 02:03:40,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == SKIP2 && 0 == pended) && 0 == compRegistered) && lowerDriverReturn == ntStatus) || (s == DC && pended == 1)) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || (!(ntStatus == 259) && (((0 == pended && 0 == compRegistered) && s == DC) || ((compRegistered == 1 && 0 == pended) && s == DC)))) || ((s == SKIP2 && 0 == compRegistered) && pended == 1) [2018-11-23 02:03:40,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && 0 == pended) && NP == s) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC [2018-11-23 02:03:40,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC [2018-11-23 02:03:40,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC [2018-11-23 02:03:40,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || SKIP1 == s) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC)) && ((((NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || ((((s == MPR1 && returnVal2 + 1073741823 <= 0) && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled)) || ((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled) && returnVal2 == 259)) || ((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 == returnVal2) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled)) [2018-11-23 02:03:40,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled) || NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || SKIP1 == s) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) [2018-11-23 02:03:40,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled) || NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || SKIP1 == s) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) [2018-11-23 02:03:40,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) && ((((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || SKIP2 == DC)) && (((!(\old(setEventCalled) == 1) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || 1 == setEventCalled)) && ((((0 == myStatus || !(\old(myStatus) == 0)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || !(customIrp == 0)) [2018-11-23 02:03:40,112 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && 0 == pended) && 0 == compRegistered) && NP == s) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,112 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\old(setEventCalled) == 1) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || 1 == setEventCalled) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) && ((((((((((((SKIP1 == MPR1 || IPC == MPR3) || NP == MPR1) || SKIP2 == DC) || ((((0 == pended && headOfList == 0) && NP == s) && headOfList == 0) && PagingReferenceCount == 1)) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || (NP == s && pended == 1)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended)))) && ((((((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || ((headOfList == 0 && headOfList == 0) && PagingReferenceCount == 1))) && ((((((0 == pended && NP == s) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 1)) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC)) && ((((((((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || 0 == myStatus) || NP == MPR1) || !(customIrp == 0)) [2018-11-23 02:03:40,112 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(MPR3 == IPC)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && NP == s) && \old(customIrp) == customIrp) && !(MPR3 == NP)) && PagingReferenceCount == 0) && !(SKIP1 == NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(MPR3 == IPC)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && NP == s) && \old(customIrp) == customIrp) && !(MPR3 == NP)) && PagingReferenceCount == 0) && !(SKIP1 == NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && pended == 1) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || ((((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == pended) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((compRegistered == 1 && !(MPR1 == SKIP1)) && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(compRegistered) == 0)) || (((((0 == pended && !(SKIP2 == s)) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && 0 == compRegistered) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((0 == pended && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((0 == status + 1073741738 && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && 0 == pended) && 0 == compRegistered) && NP == s) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || NP == s) || SKIP2 == DC [2018-11-23 02:03:40,117 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((NP == s && pended == 1) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0)) || ((0 == pended && NP == s) && !(259 == ntStatus)) [2018-11-23 02:03:40,118 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || ((NP == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC)) && ((((\old(customIrp) == customIrp || ((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || NP == s) || SKIP2 == DC)) && ((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC) [2018-11-23 02:03:40,119 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || SKIP2 == DC [2018-11-23 02:03:40,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || (((0 == pended && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) [2018-11-23 02:03:40,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) [2018-11-23 02:03:40,127 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((0 == pended && InterfaceType == 0) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1)) || ((((0 == pended && !(ntStatus == 259)) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) [2018-11-23 02:03:40,128 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((!(259 == ntStatus) && 0 == pended) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) [2018-11-23 02:03:40,128 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) [2018-11-23 02:03:40,128 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) [2018-11-23 02:03:40,128 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,128 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || NP == s) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC [2018-11-23 02:03:40,129 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,129 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || NP == s) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC [2018-11-23 02:03:40,129 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) [2018-11-23 02:03:40,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) [2018-11-23 02:03:40,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-23 02:03:40,131 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) [2018-11-23 02:03:40,132 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) [2018-11-23 02:03:40,132 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) [2018-11-23 02:03:40,135 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && NP == s) && PagingReferenceCount == 0) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) [2018-11-23 02:03:40,136 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == pended && NP == s) && PagingReferenceCount == 0) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) [2018-11-23 02:03:40,136 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) [2018-11-23 02:03:40,136 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && NP == s) && 0 == ntStatus) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0)) || ((0 == pended && ntStatus + 2147483643 <= 0) && NP == s) [2018-11-23 02:03:40,292 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9dbc2b86-fd71-4df7-b325-2c4b41da0a31/bin-2019/uautomizer/witness.graphml [2018-11-23 02:03:40,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:03:40,294 INFO L168 Benchmark]: Toolchain (without parser) took 255832.37 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 951.5 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:03:40,294 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:03:40,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1260.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 951.5 MB in the beginning and 990.7 MB in the end (delta: -39.2 MB). Peak memory consumption was 138.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:03:40,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.12 ms. Allocated memory is still 1.2 GB. Free memory was 990.7 MB in the beginning and 983.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:03:40,295 INFO L168 Benchmark]: Boogie Preprocessor took 184.89 ms. Allocated memory is still 1.2 GB. Free memory was 983.7 MB in the beginning and 941.9 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:03:40,295 INFO L168 Benchmark]: RCFGBuilder took 27223.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -209.5 MB). Peak memory consumption was 327.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:03:40,295 INFO L168 Benchmark]: TraceAbstraction took 226760.52 ms. Allocated memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-23 02:03:40,296 INFO L168 Benchmark]: Witness Printer took 314.68 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:03:40,297 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1260.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 951.5 MB in the beginning and 990.7 MB in the end (delta: -39.2 MB). Peak memory consumption was 138.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.12 ms. Allocated memory is still 1.2 GB. Free memory was 990.7 MB in the beginning and 983.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 184.89 ms. Allocated memory is still 1.2 GB. Free memory was 983.7 MB in the beginning and 941.9 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 27223.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -209.5 MB). Peak memory consumption was 327.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 226760.52 ms. Allocated memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 314.68 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2099]: 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: 2497]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3240]: Loop Invariant Derived loop invariant: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: 7156]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == status && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (0 == status + 1073741738 && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || (((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || (((((compRegistered == 1 && !(MPR1 == SKIP1)) && !(SKIP1 == NP)) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) || (((!(MPR1 == SKIP1) && 0 == compRegistered) && !(SKIP1 == NP)) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) && !(259 == status))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (0 == status + 2147483631 && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (((!(MPR1 == SKIP1) && pended == 1) && !(SKIP1 == NP)) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2511]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6452]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) - InvariantResult [Line: 7631]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8202]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7634]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2787]: Loop Invariant Derived loop invariant: ((0 == pended && NP == s) && PagingReferenceCount == 0) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) - InvariantResult [Line: 2790]: Loop Invariant Derived loop invariant: ((0 == pended && NP == s) && PagingReferenceCount == 0) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) - InvariantResult [Line: 2500]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7060]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && pended == 1) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || ((((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == pended) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((compRegistered == 1 && !(MPR1 == SKIP1)) && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(compRegistered) == 0)) || (((((0 == pended && !(SKIP2 == s)) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && 0 == compRegistered) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((0 == pended && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((0 == status + 1073741738 && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 7096]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && 0 == pended) && 0 == compRegistered) && NP == s) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 6902]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) - InvariantResult [Line: 3222]: Loop Invariant Derived loop invariant: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) - InvariantResult [Line: 3705]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || NP == s) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC - InvariantResult [Line: 3587]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((!(259 == ntStatus) && 0 == pended) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) - InvariantResult [Line: 7099]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8034]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC - InvariantResult [Line: 2705]: Loop Invariant Derived loop invariant: ((NP == s && pended == 1) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0)) || ((0 == pended && NP == s) && !(259 == ntStatus)) - InvariantResult [Line: 2509]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8018]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC - InvariantResult [Line: 8276]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2494]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3237]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: 2781]: Loop Invariant Derived loop invariant: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) - InvariantResult [Line: 6902]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) && ((((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || SKIP2 == DC)) && (((!(\old(setEventCalled) == 1) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || 1 == setEventCalled)) && ((((0 == myStatus || !(\old(myStatus) == 0)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || !(customIrp == 0)) - InvariantResult [Line: 7148]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && pended == 1) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || s == UNLOADED) || ((((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == pended) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((compRegistered == 1 && !(MPR1 == SKIP1)) && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(compRegistered) == 0)) || (((((0 == pended && !(SKIP2 == s)) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((0 == pended && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((0 == status + 1073741738 && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 6890]: Loop Invariant Derived loop invariant: (((((((!(\old(setEventCalled) == 1) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || 1 == setEventCalled) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) && ((((((((((((SKIP1 == MPR1 || IPC == MPR3) || NP == MPR1) || SKIP2 == DC) || ((((0 == pended && headOfList == 0) && NP == s) && headOfList == 0) && PagingReferenceCount == 1)) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || (NP == s && pended == 1)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended)))) && ((((((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || ((headOfList == 0 && headOfList == 0) && PagingReferenceCount == 1))) && ((((((0 == pended && NP == s) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 1)) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC)) && ((((((((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || 0 == myStatus) || NP == MPR1) || !(customIrp == 0)) - InvariantResult [Line: 7696]: Loop Invariant Derived loop invariant: (((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled) || NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || SKIP1 == s) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) - InvariantResult [Line: 7084]: Loop Invariant Derived loop invariant: ((((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && 0 == pended) && NP == s) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 7572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3231]: Loop Invariant Derived loop invariant: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: 2763]: Loop Invariant Derived loop invariant: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) - InvariantResult [Line: 7600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) - InvariantResult [Line: 7680]: Loop Invariant Derived loop invariant: (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || SKIP1 == s) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC)) && ((((NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || ((((s == MPR1 && returnVal2 + 1073741823 <= 0) && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled)) || ((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled) && returnVal2 == 259)) || ((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 == returnVal2) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled)) - InvariantResult [Line: 7488]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8279]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7396]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7699]: Loop Invariant Derived loop invariant: (((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled) || NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || SKIP1 == s) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) - InvariantResult [Line: 7984]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7575]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7603]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2506]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3708]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || NP == s) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC - InvariantResult [Line: 3862]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7883]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC) && ((NP == s && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC)) && (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || \old(customIrp) == customIrp) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && (((((\old(customIrp) == 1 && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 0 == customIrp) && 1 == setEventCalled) || ((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || (((((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s) - InvariantResult [Line: 3861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8105]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3840]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7399]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7087]: Loop Invariant Derived loop invariant: (((((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && 0 == pended) && 0 == compRegistered) && NP == s) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 7170]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((!(SKIP2 == s) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(DC))) || ((((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(\old(compRegistered) == 0)) || (!(259 == status) && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || ((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP)))) || (0 == compRegistered && ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || ((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))))))) || (((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && s == SKIP2) && 0 == compRegistered) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (s == SKIP2 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || ((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))))) || ((((0 == status + 1073741738 && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || ((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP))) && pended == 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 8257]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7702]: Loop Invariant Derived loop invariant: (((((s == MPR1 && compRetStatus1 + 1073741802 <= 0) && 0 < compRetStatus1 + 1073741803) && 1 == setEventCalled) || NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || SKIP1 == s) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) - InvariantResult [Line: 6453]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8037]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC - InvariantResult [Line: 6796]: Loop Invariant Derived loop invariant: ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || SKIP2 == DC - InvariantResult [Line: 3225]: Loop Invariant Derived loop invariant: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: 8254]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3589]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || (((0 == pended && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) - InvariantResult [Line: 2760]: Loop Invariant Derived loop invariant: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) - InvariantResult [Line: 3696]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || NP == s) || SKIP2 == DC - InvariantResult [Line: 7858]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || ((NP == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC)) && ((((\old(customIrp) == customIrp || ((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || NP == s) || SKIP2 == DC)) && ((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC) - InvariantResult [Line: 7987]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7090]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(MPR3 == IPC)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && NP == s) && \old(customIrp) == customIrp) && !(MPR3 == NP)) && PagingReferenceCount == 0) && !(SKIP1 == NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2769]: Loop Invariant Derived loop invariant: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) - InvariantResult [Line: 2503]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3611]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((0 == pended && InterfaceType == 0) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1)) || ((((0 == pended && !(ntStatus == 259)) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) - InvariantResult [Line: 3245]: Loop Invariant Derived loop invariant: ((((((s == SKIP2 && 0 == pended) && 0 == compRegistered) && lowerDriverReturn == ntStatus) || (s == DC && pended == 1)) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || (!(ntStatus == 259) && (((0 == pended && 0 == compRegistered) && s == DC) || ((compRegistered == 1 && 0 == pended) && s == DC)))) || ((s == SKIP2 && 0 == compRegistered) && pended == 1) - InvariantResult [Line: 8040]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || SKIP2 == DC - InvariantResult [Line: 7093]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(MPR3 == IPC)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && NP == s) && \old(customIrp) == customIrp) && !(MPR3 == NP)) && PagingReferenceCount == 0) && !(SKIP1 == NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2793]: Loop Invariant Derived loop invariant: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) - InvariantResult [Line: 2941]: Loop Invariant Derived loop invariant: (((0 == pended && NP == s) && 0 == ntStatus) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0)) || ((0 == pended && ntStatus + 2147483643 <= 0) && NP == s) - InvariantResult [Line: 7880]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC) && ((NP == s && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC)) && (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || \old(customIrp) == customIrp) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && (((((\old(customIrp) == 1 && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 0 == customIrp) && 1 == setEventCalled) || ((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || (((((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s) - InvariantResult [Line: 2757]: Loop Invariant Derived loop invariant: (0 == pended && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(customIrp == 0) - InvariantResult [Line: 8108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3243]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 706 locations, 1 error locations. SAFE Result, 226.6s OverallTime, 72 OverallIterations, 2 TraceHistogramMax, 176.2s AutomataDifference, 0.0s DeadEndRemovalTime, 23.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 55333 SDtfs, 22672 SDslu, 148252 SDs, 0 SdLazy, 15479 SolverSat, 3782 SolverUnsat, 62 SolverUnknown, 0 SolverNotchecked, 161.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 721 SyntacticMatches, 11 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8844occurred in iteration=20, 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: 10.5s AutomataMinimizationTime, 72 MinimizatonAttempts, 9208 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 245 LocationsWithAnnotation, 49841 PreInvPairs, 50372 NumberOfFragments, 13343 HoareAnnotationTreeSize, 49841 FomulaSimplifications, 571304 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 245 FomulaSimplificationsInter, 181376 FormulaSimplificationTreeSizeReductionInter, 19.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 6922 NumberOfCodeBlocks, 6922 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 6846 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054322 SizeOfPredicates, 9 NumberOfNonLiveVariables, 16346 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 76 InterpolantComputations, 70 PerfectInterpolantSequences, 217/232 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...