./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/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 606408aee7f307557affa0690bfaead4a8184376 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 18:35:01,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 18:35:01,602 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 18:35:01,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 18:35:01,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 18:35:01,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 18:35:01,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 18:35:01,610 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 18:35:01,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 18:35:01,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 18:35:01,612 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 18:35:01,612 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 18:35:01,613 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 18:35:01,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 18:35:01,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 18:35:01,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 18:35:01,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 18:35:01,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 18:35:01,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 18:35:01,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 18:35:01,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 18:35:01,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 18:35:01,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 18:35:01,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 18:35:01,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 18:35:01,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 18:35:01,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 18:35:01,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 18:35:01,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 18:35:01,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 18:35:01,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 18:35:01,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 18:35:01,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 18:35:01,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 18:35:01,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 18:35:01,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 18:35:01,624 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 18:35:01,631 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 18:35:01,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 18:35:01,632 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 18:35:01,632 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 18:35:01,632 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 18:35:01,633 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 18:35:01,633 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 18:35:01,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 18:35:01,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 18:35:01,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 18:35:01,635 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 18:35:01,635 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 18:35:01,635 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 18:35:01,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 18:35:01,635 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_f1e6b754-915d-40bc-97f0-afd2594366ab/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 -> 606408aee7f307557affa0690bfaead4a8184376 [2018-12-01 18:35:01,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 18:35:01,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 18:35:01,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 18:35:01,661 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 18:35:01,661 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 18:35:01,662 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-12-01 18:35:01,695 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/data/1635ab732/37b33769329545bba7eac00fc2b29261/FLAG280aa143f [2018-12-01 18:35:02,377 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 18:35:02,377 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-12-01 18:35:02,405 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/data/1635ab732/37b33769329545bba7eac00fc2b29261/FLAG280aa143f [2018-12-01 18:35:02,733 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/data/1635ab732/37b33769329545bba7eac00fc2b29261 [2018-12-01 18:35:02,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 18:35:02,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 18:35:02,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 18:35:02,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 18:35:02,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 18:35:02,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:35:02" (1/1) ... [2018-12-01 18:35:02,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4215bc03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:02, skipping insertion in model container [2018-12-01 18:35:02,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:35:02" (1/1) ... [2018-12-01 18:35:02,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 18:35:02,858 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 18:35:04,272 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:35:04,296 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 18:35:04,706 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:35:04,813 INFO L195 MainTranslator]: Completed translation [2018-12-01 18:35:04,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04 WrapperNode [2018-12-01 18:35:04,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 18:35:04,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 18:35:04,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 18:35:04,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 18:35:04,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:04,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:04,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 18:35:04,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 18:35:04,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 18:35:04,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 18:35:04,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:04,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:04,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:04,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:04,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:04,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:04,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... [2018-12-01 18:35:05,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 18:35:05,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 18:35:05,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 18:35:05,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 18:35:05,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/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-12-01 18:35:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-12-01 18:35:05,035 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-12-01 18:35:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-12-01 18:35:05,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-12-01 18:35:05,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-12-01 18:35:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 18:35:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2018-12-01 18:35:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2018-12-01 18:35:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2018-12-01 18:35:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2018-12-01 18:35:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 18:35:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-12-01 18:35:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-12-01 18:35:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-12-01 18:35:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-12-01 18:35:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-01 18:35:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-01 18:35:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-12-01 18:35:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-12-01 18:35:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2018-12-01 18:35:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2018-12-01 18:35:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-12-01 18:35:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-12-01 18:35:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2018-12-01 18:35:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2018-12-01 18:35:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-12-01 18:35:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-12-01 18:35:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-12-01 18:35:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-12-01 18:35:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-01 18:35:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-01 18:35:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2018-12-01 18:35:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2018-12-01 18:35:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-12-01 18:35:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-12-01 18:35:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-12-01 18:35:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-12-01 18:35:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyReadWrite [2018-12-01 18:35:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyReadWrite [2018-12-01 18:35:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2018-12-01 18:35:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2018-12-01 18:35:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-12-01 18:35:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-12-01 18:35:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 18:35:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2018-12-01 18:35:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2018-12-01 18:35:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-12-01 18:35:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-12-01 18:35:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-01 18:35:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-01 18:35:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-12-01 18:35:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-12-01 18:35:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-12-01 18:35:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-12-01 18:35:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 18:35:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-12-01 18:35:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-01 18:35:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-01 18:35:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2018-12-01 18:35:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2018-12-01 18:35:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-12-01 18:35:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-12-01 18:35:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2018-12-01 18:35:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2018-12-01 18:35:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-01 18:35:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-01 18:35:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-12-01 18:35:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-12-01 18:35:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-12-01 18:35:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-12-01 18:35:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2018-12-01 18:35:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2018-12-01 18:35:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 18:35:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 18:35:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-01 18:35:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-01 18:35:05,041 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-12-01 18:35:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-12-01 18:35:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-12-01 18:35:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-12-01 18:35:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 18:35:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 18:35:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2018-12-01 18:35:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2018-12-01 18:35:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 18:35:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-01 18:35:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2018-12-01 18:35:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-12-01 18:35:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2018-12-01 18:35:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-01 18:35:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-01 18:35:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2018-12-01 18:35:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-12-01 18:35:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-12-01 18:35:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 18:35:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2018-12-01 18:35:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2018-12-01 18:35:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-01 18:35:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-01 18:35:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPower [2018-12-01 18:35:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPower [2018-12-01 18:35:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2018-12-01 18:35:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2018-12-01 18:35:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-01 18:35:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-01 18:35:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2018-12-01 18:35:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2018-12-01 18:35:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyUnload [2018-12-01 18:35:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyUnload [2018-12-01 18:35:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-12-01 18:35:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-12-01 18:35:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-12-01 18:35:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-12-01 18:35:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2018-12-01 18:35:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2018-12-01 18:35:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2018-12-01 18:35:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2018-12-01 18:35:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-12-01 18:35:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-12-01 18:35:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-01 18:35:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-12-01 18:35:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-12-01 18:35:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-12-01 18:35:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-12-01 18:35:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-12-01 18:35:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-12-01 18:35:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-12-01 18:35:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-12-01 18:35:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-12-01 18:35:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 18:35:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 18:35:05,588 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:05,588 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:05,698 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:05,699 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:06,721 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:06,721 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:06,800 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:06,800 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:07,241 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:07,242 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:07,254 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:07,254 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,456 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,456 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,463 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,463 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,474 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,474 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,480 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,480 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,570 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,570 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,595 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,595 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,741 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,741 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,816 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,816 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,829 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,829 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:09,833 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:09,833 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:10,450 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:10,451 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:13,639 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:13,639 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:16,723 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 18:35:16,723 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 18:35:16,738 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 18:35:16,739 INFO L280 CfgBuilder]: Removed 49 assue(true) statements. [2018-12-01 18:35:16,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:35:16 BoogieIcfgContainer [2018-12-01 18:35:16,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 18:35:16,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 18:35:16,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 18:35:16,741 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 18:35:16,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 06:35:02" (1/3) ... [2018-12-01 18:35:16,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1872f681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 06:35:16, skipping insertion in model container [2018-12-01 18:35:16,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:35:04" (2/3) ... [2018-12-01 18:35:16,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1872f681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 06:35:16, skipping insertion in model container [2018-12-01 18:35:16,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:35:16" (3/3) ... [2018-12-01 18:35:16,743 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy2_true-unreach-call_true-termination.i.cil.c [2018-12-01 18:35:16,749 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 18:35:16,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 18:35:16,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 18:35:16,785 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 18:35:16,785 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 18:35:16,785 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 18:35:16,785 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 18:35:16,785 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 18:35:16,785 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 18:35:16,785 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 18:35:16,785 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 18:35:16,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 18:35:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states. [2018-12-01 18:35:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 18:35:16,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:16,808 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] [2018-12-01 18:35:16,809 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:16,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 749980279, now seen corresponding path program 1 times [2018-12-01 18:35:16,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:16,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:16,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:16,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:16,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:17,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:17,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 18:35:17,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-01 18:35:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 18:35:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 18:35:17,041 INFO L87 Difference]: Start difference. First operand 943 states. Second operand 2 states. [2018-12-01 18:35:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:17,112 INFO L93 Difference]: Finished difference Result 1875 states and 2881 transitions. [2018-12-01 18:35:17,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 18:35:17,113 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 43 [2018-12-01 18:35:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:17,124 INFO L225 Difference]: With dead ends: 1875 [2018-12-01 18:35:17,124 INFO L226 Difference]: Without dead ends: 936 [2018-12-01 18:35:17,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 18:35:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-12-01 18:35:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2018-12-01 18:35:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-12-01 18:35:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1285 transitions. [2018-12-01 18:35:17,194 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1285 transitions. Word has length 43 [2018-12-01 18:35:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:17,194 INFO L480 AbstractCegarLoop]: Abstraction has 936 states and 1285 transitions. [2018-12-01 18:35:17,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-01 18:35:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1285 transitions. [2018-12-01 18:35:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 18:35:17,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:17,196 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] [2018-12-01 18:35:17,196 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:17,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash 677593721, now seen corresponding path program 1 times [2018-12-01 18:35:17,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:17,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:17,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:17,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:17,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:17,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:17,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:17,331 INFO L87 Difference]: Start difference. First operand 936 states and 1285 transitions. Second operand 3 states. [2018-12-01 18:35:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:17,460 INFO L93 Difference]: Finished difference Result 972 states and 1322 transitions. [2018-12-01 18:35:17,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:17,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-01 18:35:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:17,465 INFO L225 Difference]: With dead ends: 972 [2018-12-01 18:35:17,465 INFO L226 Difference]: Without dead ends: 950 [2018-12-01 18:35:17,466 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-12-01 18:35:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-01 18:35:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-01 18:35:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-01 18:35:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1295 transitions. [2018-12-01 18:35:17,505 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1295 transitions. Word has length 43 [2018-12-01 18:35:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:17,506 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1295 transitions. [2018-12-01 18:35:17,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1295 transitions. [2018-12-01 18:35:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 18:35:17,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:17,508 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] [2018-12-01 18:35:17,508 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:17,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:17,508 INFO L82 PathProgramCache]: Analyzing trace with hash -339381255, now seen corresponding path program 1 times [2018-12-01 18:35:17,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:17,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:17,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:17,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:17,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:17,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:17,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:17,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:17,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:17,669 INFO L87 Difference]: Start difference. First operand 950 states and 1295 transitions. Second operand 3 states. [2018-12-01 18:35:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:17,884 INFO L93 Difference]: Finished difference Result 2632 states and 3695 transitions. [2018-12-01 18:35:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:17,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-01 18:35:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:17,893 INFO L225 Difference]: With dead ends: 2632 [2018-12-01 18:35:17,893 INFO L226 Difference]: Without dead ends: 1721 [2018-12-01 18:35:17,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-12-01 18:35:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2018-12-01 18:35:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2018-12-01 18:35:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-12-01 18:35:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2373 transitions. [2018-12-01 18:35:17,960 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2373 transitions. Word has length 56 [2018-12-01 18:35:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:17,960 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 2373 transitions. [2018-12-01 18:35:17,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2373 transitions. [2018-12-01 18:35:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-01 18:35:17,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:17,963 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-12-01 18:35:17,964 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:17,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:17,964 INFO L82 PathProgramCache]: Analyzing trace with hash -601260739, now seen corresponding path program 1 times [2018-12-01 18:35:17,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:17,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:17,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:18,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:18,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:35:18,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:35:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:35:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:18,143 INFO L87 Difference]: Start difference. First operand 1719 states and 2373 transitions. Second operand 4 states. [2018-12-01 18:35:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:18,230 INFO L93 Difference]: Finished difference Result 3396 states and 4703 transitions. [2018-12-01 18:35:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:35:18,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-01 18:35:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:18,235 INFO L225 Difference]: With dead ends: 3396 [2018-12-01 18:35:18,235 INFO L226 Difference]: Without dead ends: 1747 [2018-12-01 18:35:18,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2018-12-01 18:35:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1729. [2018-12-01 18:35:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2018-12-01 18:35:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2383 transitions. [2018-12-01 18:35:18,273 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2383 transitions. Word has length 79 [2018-12-01 18:35:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:18,273 INFO L480 AbstractCegarLoop]: Abstraction has 1729 states and 2383 transitions. [2018-12-01 18:35:18,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:35:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2383 transitions. [2018-12-01 18:35:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-01 18:35:18,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:18,275 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-12-01 18:35:18,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:18,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash -260392060, now seen corresponding path program 1 times [2018-12-01 18:35:18,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:18,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:18,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:18,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:18,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:18,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:18,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:35:18,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:35:18,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:35:18,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:18,432 INFO L87 Difference]: Start difference. First operand 1729 states and 2383 transitions. Second operand 4 states. [2018-12-01 18:35:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:18,529 INFO L93 Difference]: Finished difference Result 3406 states and 4713 transitions. [2018-12-01 18:35:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:35:18,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-01 18:35:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:18,537 INFO L225 Difference]: With dead ends: 3406 [2018-12-01 18:35:18,537 INFO L226 Difference]: Without dead ends: 1757 [2018-12-01 18:35:18,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2018-12-01 18:35:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1739. [2018-12-01 18:35:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2018-12-01 18:35:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2393 transitions. [2018-12-01 18:35:18,598 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2393 transitions. Word has length 80 [2018-12-01 18:35:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:18,599 INFO L480 AbstractCegarLoop]: Abstraction has 1739 states and 2393 transitions. [2018-12-01 18:35:18,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:35:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2393 transitions. [2018-12-01 18:35:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 18:35:18,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:18,601 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-12-01 18:35:18,601 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:18,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash 892515068, now seen corresponding path program 1 times [2018-12-01 18:35:18,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:18,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:18,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:18,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:35:18,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:35:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:35:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:18,821 INFO L87 Difference]: Start difference. First operand 1739 states and 2393 transitions. Second operand 4 states. [2018-12-01 18:35:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:18,923 INFO L93 Difference]: Finished difference Result 3419 states and 4735 transitions. [2018-12-01 18:35:18,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:35:18,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-01 18:35:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:18,932 INFO L225 Difference]: With dead ends: 3419 [2018-12-01 18:35:18,932 INFO L226 Difference]: Without dead ends: 1770 [2018-12-01 18:35:18,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2018-12-01 18:35:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1749. [2018-12-01 18:35:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2018-12-01 18:35:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2410 transitions. [2018-12-01 18:35:18,975 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2410 transitions. Word has length 81 [2018-12-01 18:35:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:18,975 INFO L480 AbstractCegarLoop]: Abstraction has 1749 states and 2410 transitions. [2018-12-01 18:35:18,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:35:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2410 transitions. [2018-12-01 18:35:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 18:35:18,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:18,976 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] [2018-12-01 18:35:18,977 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:18,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash -275118823, now seen corresponding path program 1 times [2018-12-01 18:35:18,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:18,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:19,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:19,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:19,069 INFO L87 Difference]: Start difference. First operand 1749 states and 2410 transitions. Second operand 3 states. [2018-12-01 18:35:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:19,220 INFO L93 Difference]: Finished difference Result 3472 states and 4865 transitions. [2018-12-01 18:35:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:19,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-01 18:35:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:19,227 INFO L225 Difference]: With dead ends: 3472 [2018-12-01 18:35:19,228 INFO L226 Difference]: Without dead ends: 1818 [2018-12-01 18:35:19,233 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-12-01 18:35:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2018-12-01 18:35:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1816. [2018-12-01 18:35:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2018-12-01 18:35:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2496 transitions. [2018-12-01 18:35:19,279 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2496 transitions. Word has length 78 [2018-12-01 18:35:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:19,280 INFO L480 AbstractCegarLoop]: Abstraction has 1816 states and 2496 transitions. [2018-12-01 18:35:19,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2496 transitions. [2018-12-01 18:35:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-01 18:35:19,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:19,281 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-12-01 18:35:19,281 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:19,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash 874664422, now seen corresponding path program 1 times [2018-12-01 18:35:19,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:19,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:19,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:19,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:19,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:19,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:19,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:19,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:19,369 INFO L87 Difference]: Start difference. First operand 1816 states and 2496 transitions. Second operand 3 states. [2018-12-01 18:35:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:19,596 INFO L93 Difference]: Finished difference Result 4409 states and 6245 transitions. [2018-12-01 18:35:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:19,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-01 18:35:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:19,607 INFO L225 Difference]: With dead ends: 4409 [2018-12-01 18:35:19,607 INFO L226 Difference]: Without dead ends: 2689 [2018-12-01 18:35:19,614 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-12-01 18:35:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2018-12-01 18:35:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2686. [2018-12-01 18:35:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2686 states. [2018-12-01 18:35:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 3733 transitions. [2018-12-01 18:35:19,674 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 3733 transitions. Word has length 76 [2018-12-01 18:35:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:19,674 INFO L480 AbstractCegarLoop]: Abstraction has 2686 states and 3733 transitions. [2018-12-01 18:35:19,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 3733 transitions. [2018-12-01 18:35:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 18:35:19,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:19,676 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] [2018-12-01 18:35:19,676 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:19,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1448810339, now seen corresponding path program 1 times [2018-12-01 18:35:19,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:19,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:19,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:19,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:19,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:35:19,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:35:19,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:35:19,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:19,819 INFO L87 Difference]: Start difference. First operand 2686 states and 3733 transitions. Second operand 4 states. [2018-12-01 18:35:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:19,922 INFO L93 Difference]: Finished difference Result 3353 states and 4609 transitions. [2018-12-01 18:35:19,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:35:19,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-01 18:35:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:19,934 INFO L225 Difference]: With dead ends: 3353 [2018-12-01 18:35:19,934 INFO L226 Difference]: Without dead ends: 2733 [2018-12-01 18:35:19,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2018-12-01 18:35:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2702. [2018-12-01 18:35:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2018-12-01 18:35:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3764 transitions. [2018-12-01 18:35:20,001 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3764 transitions. Word has length 82 [2018-12-01 18:35:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:20,001 INFO L480 AbstractCegarLoop]: Abstraction has 2702 states and 3764 transitions. [2018-12-01 18:35:20,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:35:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3764 transitions. [2018-12-01 18:35:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 18:35:20,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:20,003 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, 1, 1, 1, 1] [2018-12-01 18:35:20,003 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:20,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:20,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1603420840, now seen corresponding path program 1 times [2018-12-01 18:35:20,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:20,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:20,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:20,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:20,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:35:20,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:20,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:20,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:20,114 INFO L87 Difference]: Start difference. First operand 2702 states and 3764 transitions. Second operand 3 states. [2018-12-01 18:35:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:20,268 INFO L93 Difference]: Finished difference Result 7839 states and 11191 transitions. [2018-12-01 18:35:20,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:20,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-01 18:35:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:20,283 INFO L225 Difference]: With dead ends: 7839 [2018-12-01 18:35:20,284 INFO L226 Difference]: Without dead ends: 5240 [2018-12-01 18:35:20,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-12-01 18:35:20,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5240 states. [2018-12-01 18:35:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5240 to 5238. [2018-12-01 18:35:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5238 states. [2018-12-01 18:35:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 7430 transitions. [2018-12-01 18:35:20,415 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 7430 transitions. Word has length 82 [2018-12-01 18:35:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:20,416 INFO L480 AbstractCegarLoop]: Abstraction has 5238 states and 7430 transitions. [2018-12-01 18:35:20,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 7430 transitions. [2018-12-01 18:35:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 18:35:20,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:20,417 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-12-01 18:35:20,418 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:20,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2058151995, now seen corresponding path program 1 times [2018-12-01 18:35:20,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:20,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:20,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:20,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:20,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:20,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:20,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:20,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:20,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:20,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:20,540 INFO L87 Difference]: Start difference. First operand 5238 states and 7430 transitions. Second operand 3 states. [2018-12-01 18:35:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:20,875 INFO L93 Difference]: Finished difference Result 15295 states and 22812 transitions. [2018-12-01 18:35:20,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:20,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-01 18:35:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:20,908 INFO L225 Difference]: With dead ends: 15295 [2018-12-01 18:35:20,908 INFO L226 Difference]: Without dead ends: 10161 [2018-12-01 18:35:20,926 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-12-01 18:35:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10161 states. [2018-12-01 18:35:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10161 to 10153. [2018-12-01 18:35:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10153 states. [2018-12-01 18:35:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10153 states to 10153 states and 14949 transitions. [2018-12-01 18:35:21,143 INFO L78 Accepts]: Start accepts. Automaton has 10153 states and 14949 transitions. Word has length 95 [2018-12-01 18:35:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:21,144 INFO L480 AbstractCegarLoop]: Abstraction has 10153 states and 14949 transitions. [2018-12-01 18:35:21,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 10153 states and 14949 transitions. [2018-12-01 18:35:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 18:35:21,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:21,145 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-12-01 18:35:21,146 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:21,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:21,146 INFO L82 PathProgramCache]: Analyzing trace with hash -91683281, now seen corresponding path program 1 times [2018-12-01 18:35:21,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:21,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:21,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:21,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:21,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:21,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:35:21,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:35:21,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:35:21,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:21,230 INFO L87 Difference]: Start difference. First operand 10153 states and 14949 transitions. Second operand 4 states. [2018-12-01 18:35:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:21,404 INFO L93 Difference]: Finished difference Result 10306 states and 15138 transitions. [2018-12-01 18:35:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:35:21,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-01 18:35:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:21,429 INFO L225 Difference]: With dead ends: 10306 [2018-12-01 18:35:21,429 INFO L226 Difference]: Without dead ends: 10265 [2018-12-01 18:35:21,433 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-12-01 18:35:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2018-12-01 18:35:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 10149. [2018-12-01 18:35:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10149 states. [2018-12-01 18:35:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10149 states to 10149 states and 14943 transitions. [2018-12-01 18:35:21,633 INFO L78 Accepts]: Start accepts. Automaton has 10149 states and 14943 transitions. Word has length 81 [2018-12-01 18:35:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:21,633 INFO L480 AbstractCegarLoop]: Abstraction has 10149 states and 14943 transitions. [2018-12-01 18:35:21,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:35:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10149 states and 14943 transitions. [2018-12-01 18:35:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-01 18:35:21,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:21,635 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-12-01 18:35:21,635 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:21,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:21,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1882022250, now seen corresponding path program 1 times [2018-12-01 18:35:21,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:21,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:21,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:21,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:21,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 18:35:21,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 18:35:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 18:35:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 18:35:21,746 INFO L87 Difference]: Start difference. First operand 10149 states and 14943 transitions. Second operand 8 states. [2018-12-01 18:35:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:21,918 INFO L93 Difference]: Finished difference Result 10196 states and 15016 transitions. [2018-12-01 18:35:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 18:35:21,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-01 18:35:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:21,940 INFO L225 Difference]: With dead ends: 10196 [2018-12-01 18:35:21,940 INFO L226 Difference]: Without dead ends: 10163 [2018-12-01 18:35:21,944 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-12-01 18:35:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10163 states. [2018-12-01 18:35:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10163 to 10160. [2018-12-01 18:35:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10160 states. [2018-12-01 18:35:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10160 states to 10160 states and 14972 transitions. [2018-12-01 18:35:22,141 INFO L78 Accepts]: Start accepts. Automaton has 10160 states and 14972 transitions. Word has length 79 [2018-12-01 18:35:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:22,141 INFO L480 AbstractCegarLoop]: Abstraction has 10160 states and 14972 transitions. [2018-12-01 18:35:22,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 18:35:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 10160 states and 14972 transitions. [2018-12-01 18:35:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 18:35:22,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:22,143 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] [2018-12-01 18:35:22,143 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:22,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1499973711, now seen corresponding path program 1 times [2018-12-01 18:35:22,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:22,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:22,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:22,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:22,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:22,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 18:35:22,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 18:35:22,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 18:35:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 18:35:22,325 INFO L87 Difference]: Start difference. First operand 10160 states and 14972 transitions. Second operand 8 states. [2018-12-01 18:35:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:22,508 INFO L93 Difference]: Finished difference Result 10183 states and 15001 transitions. [2018-12-01 18:35:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 18:35:22,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-01 18:35:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:22,531 INFO L225 Difference]: With dead ends: 10183 [2018-12-01 18:35:22,531 INFO L226 Difference]: Without dead ends: 10150 [2018-12-01 18:35:22,535 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-12-01 18:35:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10150 states. [2018-12-01 18:35:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10150 to 10147. [2018-12-01 18:35:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10147 states. [2018-12-01 18:35:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10147 states to 10147 states and 14957 transitions. [2018-12-01 18:35:22,734 INFO L78 Accepts]: Start accepts. Automaton has 10147 states and 14957 transitions. Word has length 78 [2018-12-01 18:35:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:22,734 INFO L480 AbstractCegarLoop]: Abstraction has 10147 states and 14957 transitions. [2018-12-01 18:35:22,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 18:35:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 10147 states and 14957 transitions. [2018-12-01 18:35:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 18:35:22,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:22,736 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] [2018-12-01 18:35:22,736 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:22,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1269128679, now seen corresponding path program 1 times [2018-12-01 18:35:22,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:22,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:22,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:22,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:22,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:22,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:22,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:35:22,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:35:22,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:35:22,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:22,825 INFO L87 Difference]: Start difference. First operand 10147 states and 14957 transitions. Second operand 4 states. [2018-12-01 18:35:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:23,004 INFO L93 Difference]: Finished difference Result 10466 states and 15343 transitions. [2018-12-01 18:35:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:35:23,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-01 18:35:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:23,027 INFO L225 Difference]: With dead ends: 10466 [2018-12-01 18:35:23,027 INFO L226 Difference]: Without dead ends: 10204 [2018-12-01 18:35:23,031 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-12-01 18:35:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10204 states. [2018-12-01 18:35:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10204 to 10162. [2018-12-01 18:35:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10162 states. [2018-12-01 18:35:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 14974 transitions. [2018-12-01 18:35:23,215 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 14974 transitions. Word has length 82 [2018-12-01 18:35:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:23,216 INFO L480 AbstractCegarLoop]: Abstraction has 10162 states and 14974 transitions. [2018-12-01 18:35:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:35:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 14974 transitions. [2018-12-01 18:35:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-01 18:35:23,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:23,217 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-12-01 18:35:23,217 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:23,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 489150260, now seen corresponding path program 1 times [2018-12-01 18:35:23,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:23,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:23,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:23,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-12-01 18:35:23,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:23,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:35:23,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:35:23,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:35:23,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:35:23,303 INFO L87 Difference]: Start difference. First operand 10162 states and 14974 transitions. Second operand 4 states. [2018-12-01 18:35:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:23,453 INFO L93 Difference]: Finished difference Result 10257 states and 15104 transitions. [2018-12-01 18:35:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:35:23,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-01 18:35:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:23,474 INFO L225 Difference]: With dead ends: 10257 [2018-12-01 18:35:23,474 INFO L226 Difference]: Without dead ends: 10217 [2018-12-01 18:35:23,478 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-12-01 18:35:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2018-12-01 18:35:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 10168. [2018-12-01 18:35:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10168 states. [2018-12-01 18:35:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10168 states to 10168 states and 14986 transitions. [2018-12-01 18:35:23,666 INFO L78 Accepts]: Start accepts. Automaton has 10168 states and 14986 transitions. Word has length 80 [2018-12-01 18:35:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:23,666 INFO L480 AbstractCegarLoop]: Abstraction has 10168 states and 14986 transitions. [2018-12-01 18:35:23,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:35:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10168 states and 14986 transitions. [2018-12-01 18:35:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-01 18:35:23,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:23,668 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-12-01 18:35:23,668 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:23,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash 278370407, now seen corresponding path program 1 times [2018-12-01 18:35:23,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:23,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:23,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:23,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 18:35:23,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 18:35:23,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 18:35:23,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 18:35:23,802 INFO L87 Difference]: Start difference. First operand 10168 states and 14986 transitions. Second operand 8 states. [2018-12-01 18:35:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:24,022 INFO L93 Difference]: Finished difference Result 10237 states and 15089 transitions. [2018-12-01 18:35:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 18:35:24,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-12-01 18:35:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:24,040 INFO L225 Difference]: With dead ends: 10237 [2018-12-01 18:35:24,040 INFO L226 Difference]: Without dead ends: 10216 [2018-12-01 18:35:24,044 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-12-01 18:35:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10216 states. [2018-12-01 18:35:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10216 to 10192. [2018-12-01 18:35:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10192 states. [2018-12-01 18:35:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10192 states to 10192 states and 15018 transitions. [2018-12-01 18:35:24,222 INFO L78 Accepts]: Start accepts. Automaton has 10192 states and 15018 transitions. Word has length 90 [2018-12-01 18:35:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:24,222 INFO L480 AbstractCegarLoop]: Abstraction has 10192 states and 15018 transitions. [2018-12-01 18:35:24,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 18:35:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 10192 states and 15018 transitions. [2018-12-01 18:35:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-01 18:35:24,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:35:24,224 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:24,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 816708719, now seen corresponding path program 1 times [2018-12-01 18:35:24,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:24,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:24,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:24,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:24,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 18:35:24,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 18:35:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 18:35:24,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 18:35:24,366 INFO L87 Difference]: Start difference. First operand 10192 states and 15018 transitions. Second operand 8 states. [2018-12-01 18:35:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:24,531 INFO L93 Difference]: Finished difference Result 10261 states and 15121 transitions. [2018-12-01 18:35:24,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 18:35:24,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-01 18:35:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:24,548 INFO L225 Difference]: With dead ends: 10261 [2018-12-01 18:35:24,548 INFO L226 Difference]: Without dead ends: 10240 [2018-12-01 18:35:24,551 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-12-01 18:35:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10240 states. [2018-12-01 18:35:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10240 to 10213. [2018-12-01 18:35:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10213 states. [2018-12-01 18:35:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10213 states to 10213 states and 15045 transitions. [2018-12-01 18:35:24,720 INFO L78 Accepts]: Start accepts. Automaton has 10213 states and 15045 transitions. Word has length 92 [2018-12-01 18:35:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:24,720 INFO L480 AbstractCegarLoop]: Abstraction has 10213 states and 15045 transitions. [2018-12-01 18:35:24,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 18:35:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 10213 states and 15045 transitions. [2018-12-01 18:35:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 18:35:24,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:24,721 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] [2018-12-01 18:35:24,721 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:24,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:24,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1153676747, now seen corresponding path program 1 times [2018-12-01 18:35:24,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:24,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:24,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:24,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:24,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:24,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:24,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:24,809 INFO L87 Difference]: Start difference. First operand 10213 states and 15045 transitions. Second operand 3 states. [2018-12-01 18:35:25,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:25,171 INFO L93 Difference]: Finished difference Result 23798 states and 36857 transitions. [2018-12-01 18:35:25,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:25,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-01 18:35:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:25,199 INFO L225 Difference]: With dead ends: 23798 [2018-12-01 18:35:25,199 INFO L226 Difference]: Without dead ends: 13659 [2018-12-01 18:35:25,227 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-12-01 18:35:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13659 states. [2018-12-01 18:35:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13659 to 13639. [2018-12-01 18:35:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13639 states. [2018-12-01 18:35:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13639 states to 13639 states and 20414 transitions. [2018-12-01 18:35:25,545 INFO L78 Accepts]: Start accepts. Automaton has 13639 states and 20414 transitions. Word has length 91 [2018-12-01 18:35:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:25,545 INFO L480 AbstractCegarLoop]: Abstraction has 13639 states and 20414 transitions. [2018-12-01 18:35:25,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 13639 states and 20414 transitions. [2018-12-01 18:35:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 18:35:25,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:25,546 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] [2018-12-01 18:35:25,547 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:25,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:25,547 INFO L82 PathProgramCache]: Analyzing trace with hash -887643117, now seen corresponding path program 1 times [2018-12-01 18:35:25,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:25,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:25,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:25,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:25,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:25,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:25,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 18:35:25,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 18:35:25,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 18:35:25,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 18:35:25,736 INFO L87 Difference]: Start difference. First operand 13639 states and 20414 transitions. Second operand 12 states. [2018-12-01 18:35:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:26,212 INFO L93 Difference]: Finished difference Result 13737 states and 20531 transitions. [2018-12-01 18:35:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 18:35:26,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-12-01 18:35:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:26,235 INFO L225 Difference]: With dead ends: 13737 [2018-12-01 18:35:26,236 INFO L226 Difference]: Without dead ends: 13718 [2018-12-01 18:35:26,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-01 18:35:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13718 states. [2018-12-01 18:35:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13718 to 13672. [2018-12-01 18:35:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13672 states. [2018-12-01 18:35:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13672 states to 13672 states and 20450 transitions. [2018-12-01 18:35:26,473 INFO L78 Accepts]: Start accepts. Automaton has 13672 states and 20450 transitions. Word has length 91 [2018-12-01 18:35:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:26,473 INFO L480 AbstractCegarLoop]: Abstraction has 13672 states and 20450 transitions. [2018-12-01 18:35:26,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 18:35:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 13672 states and 20450 transitions. [2018-12-01 18:35:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-01 18:35:26,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:26,474 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-12-01 18:35:26,474 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:26,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1117623323, now seen corresponding path program 1 times [2018-12-01 18:35:26,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:26,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:26,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:26,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 18:35:26,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 18:35:26,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 18:35:26,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 18:35:26,610 INFO L87 Difference]: Start difference. First operand 13672 states and 20450 transitions. Second operand 12 states. [2018-12-01 18:35:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:27,136 INFO L93 Difference]: Finished difference Result 13795 states and 20687 transitions. [2018-12-01 18:35:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 18:35:27,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-12-01 18:35:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:27,161 INFO L225 Difference]: With dead ends: 13795 [2018-12-01 18:35:27,161 INFO L226 Difference]: Without dead ends: 13776 [2018-12-01 18:35:27,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-01 18:35:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13776 states. [2018-12-01 18:35:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13776 to 13738. [2018-12-01 18:35:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13738 states. [2018-12-01 18:35:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13738 states to 13738 states and 20598 transitions. [2018-12-01 18:35:27,400 INFO L78 Accepts]: Start accepts. Automaton has 13738 states and 20598 transitions. Word has length 99 [2018-12-01 18:35:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:27,400 INFO L480 AbstractCegarLoop]: Abstraction has 13738 states and 20598 transitions. [2018-12-01 18:35:27,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 18:35:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 13738 states and 20598 transitions. [2018-12-01 18:35:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 18:35:27,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:27,401 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] [2018-12-01 18:35:27,402 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:27,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash 509192028, now seen corresponding path program 1 times [2018-12-01 18:35:27,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:27,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:27,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:27,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:27,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 18:35:27,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 18:35:27,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 18:35:27,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 18:35:27,507 INFO L87 Difference]: Start difference. First operand 13738 states and 20598 transitions. Second operand 8 states. [2018-12-01 18:35:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:27,692 INFO L93 Difference]: Finished difference Result 13830 states and 20711 transitions. [2018-12-01 18:35:27,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 18:35:27,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-01 18:35:27,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:27,716 INFO L225 Difference]: With dead ends: 13830 [2018-12-01 18:35:27,716 INFO L226 Difference]: Without dead ends: 13809 [2018-12-01 18:35:27,721 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-12-01 18:35:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2018-12-01 18:35:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13759. [2018-12-01 18:35:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-12-01 18:35:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 20610 transitions. [2018-12-01 18:35:28,020 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 20610 transitions. Word has length 100 [2018-12-01 18:35:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:28,021 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 20610 transitions. [2018-12-01 18:35:28,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 18:35:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 20610 transitions. [2018-12-01 18:35:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 18:35:28,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:28,022 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] [2018-12-01 18:35:28,022 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:28,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1932092970, now seen corresponding path program 1 times [2018-12-01 18:35:28,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:28,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:28,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:28,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 18:35:28,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 18:35:28,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 18:35:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 18:35:28,135 INFO L87 Difference]: Start difference. First operand 13759 states and 20610 transitions. Second operand 9 states. [2018-12-01 18:35:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:28,533 INFO L93 Difference]: Finished difference Result 27612 states and 42754 transitions. [2018-12-01 18:35:28,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 18:35:28,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2018-12-01 18:35:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:28,562 INFO L225 Difference]: With dead ends: 27612 [2018-12-01 18:35:28,562 INFO L226 Difference]: Without dead ends: 13895 [2018-12-01 18:35:28,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-12-01 18:35:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13895 states. [2018-12-01 18:35:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13895 to 13797. [2018-12-01 18:35:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13797 states. [2018-12-01 18:35:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13797 states to 13797 states and 20652 transitions. [2018-12-01 18:35:28,841 INFO L78 Accepts]: Start accepts. Automaton has 13797 states and 20652 transitions. Word has length 100 [2018-12-01 18:35:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:28,841 INFO L480 AbstractCegarLoop]: Abstraction has 13797 states and 20652 transitions. [2018-12-01 18:35:28,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 18:35:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 13797 states and 20652 transitions. [2018-12-01 18:35:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-01 18:35:28,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:28,843 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-12-01 18:35:28,843 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:28,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash 42163119, now seen corresponding path program 1 times [2018-12-01 18:35:28,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:28,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:28,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:28,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:28,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:28,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 18:35:28,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 18:35:28,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 18:35:28,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 18:35:28,950 INFO L87 Difference]: Start difference. First operand 13797 states and 20652 transitions. Second operand 6 states. [2018-12-01 18:35:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:30,080 INFO L93 Difference]: Finished difference Result 27525 states and 42189 transitions. [2018-12-01 18:35:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 18:35:30,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-12-01 18:35:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:30,109 INFO L225 Difference]: With dead ends: 27525 [2018-12-01 18:35:30,109 INFO L226 Difference]: Without dead ends: 13799 [2018-12-01 18:35:30,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-01 18:35:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states. [2018-12-01 18:35:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 13759. [2018-12-01 18:35:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-12-01 18:35:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 19970 transitions. [2018-12-01 18:35:30,447 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 19970 transitions. Word has length 108 [2018-12-01 18:35:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:30,447 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 19970 transitions. [2018-12-01 18:35:30,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 18:35:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 19970 transitions. [2018-12-01 18:35:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-01 18:35:30,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:30,449 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-12-01 18:35:30,449 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:30,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash 631278707, now seen corresponding path program 1 times [2018-12-01 18:35:30,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:30,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:30,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:30,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 18:35:30,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 18:35:30,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 18:35:30,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 18:35:30,590 INFO L87 Difference]: Start difference. First operand 13759 states and 19970 transitions. Second operand 12 states. [2018-12-01 18:35:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:31,122 INFO L93 Difference]: Finished difference Result 13861 states and 20111 transitions. [2018-12-01 18:35:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 18:35:31,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-12-01 18:35:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:31,146 INFO L225 Difference]: With dead ends: 13861 [2018-12-01 18:35:31,146 INFO L226 Difference]: Without dead ends: 13842 [2018-12-01 18:35:31,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-01 18:35:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13842 states. [2018-12-01 18:35:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13842 to 13794. [2018-12-01 18:35:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13794 states. [2018-12-01 18:35:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13794 states to 13794 states and 20022 transitions. [2018-12-01 18:35:31,391 INFO L78 Accepts]: Start accepts. Automaton has 13794 states and 20022 transitions. Word has length 103 [2018-12-01 18:35:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:31,391 INFO L480 AbstractCegarLoop]: Abstraction has 13794 states and 20022 transitions. [2018-12-01 18:35:31,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 18:35:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 13794 states and 20022 transitions. [2018-12-01 18:35:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-01 18:35:31,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:31,393 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] [2018-12-01 18:35:31,393 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:31,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:31,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1810762344, now seen corresponding path program 1 times [2018-12-01 18:35:31,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:31,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:31,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:31,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 18:35:31,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 18:35:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 18:35:31,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 18:35:31,541 INFO L87 Difference]: Start difference. First operand 13794 states and 20022 transitions. Second operand 12 states. [2018-12-01 18:35:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:32,092 INFO L93 Difference]: Finished difference Result 13892 states and 20109 transitions. [2018-12-01 18:35:32,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 18:35:32,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-12-01 18:35:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:32,116 INFO L225 Difference]: With dead ends: 13892 [2018-12-01 18:35:32,116 INFO L226 Difference]: Without dead ends: 13873 [2018-12-01 18:35:32,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-01 18:35:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13873 states. [2018-12-01 18:35:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13873 to 13759. [2018-12-01 18:35:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-12-01 18:35:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 19932 transitions. [2018-12-01 18:35:32,364 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 19932 transitions. Word has length 111 [2018-12-01 18:35:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:32,364 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 19932 transitions. [2018-12-01 18:35:32,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 18:35:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 19932 transitions. [2018-12-01 18:35:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-01 18:35:32,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:32,365 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-12-01 18:35:32,366 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:32,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:32,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1852412588, now seen corresponding path program 1 times [2018-12-01 18:35:32,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:32,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:32,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:32,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:32,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:32,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:32,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:32,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:32,446 INFO L87 Difference]: Start difference. First operand 13759 states and 19932 transitions. Second operand 3 states. [2018-12-01 18:35:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:32,749 INFO L93 Difference]: Finished difference Result 20757 states and 30663 transitions. [2018-12-01 18:35:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:32,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-01 18:35:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:32,779 INFO L225 Difference]: With dead ends: 20757 [2018-12-01 18:35:32,779 INFO L226 Difference]: Without dead ends: 13791 [2018-12-01 18:35:32,801 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-12-01 18:35:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13791 states. [2018-12-01 18:35:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13791 to 13791. [2018-12-01 18:35:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13791 states. [2018-12-01 18:35:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13791 states to 13791 states and 19960 transitions. [2018-12-01 18:35:33,119 INFO L78 Accepts]: Start accepts. Automaton has 13791 states and 19960 transitions. Word has length 120 [2018-12-01 18:35:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:33,119 INFO L480 AbstractCegarLoop]: Abstraction has 13791 states and 19960 transitions. [2018-12-01 18:35:33,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 13791 states and 19960 transitions. [2018-12-01 18:35:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-01 18:35:33,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:33,121 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 18:35:33,121 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:33,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash -436029665, now seen corresponding path program 1 times [2018-12-01 18:35:33,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:33,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:35:33,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:33,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 18:35:33,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 18:35:33,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 18:35:33,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-01 18:35:33,270 INFO L87 Difference]: Start difference. First operand 13791 states and 19960 transitions. Second operand 13 states. [2018-12-01 18:35:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:33,882 INFO L93 Difference]: Finished difference Result 13974 states and 20217 transitions. [2018-12-01 18:35:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 18:35:33,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-01 18:35:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:33,906 INFO L225 Difference]: With dead ends: 13974 [2018-12-01 18:35:33,906 INFO L226 Difference]: Without dead ends: 13955 [2018-12-01 18:35:33,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-01 18:35:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13955 states. [2018-12-01 18:35:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13955 to 13883. [2018-12-01 18:35:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13883 states. [2018-12-01 18:35:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13883 states to 13883 states and 20100 transitions. [2018-12-01 18:35:34,153 INFO L78 Accepts]: Start accepts. Automaton has 13883 states and 20100 transitions. Word has length 115 [2018-12-01 18:35:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:34,153 INFO L480 AbstractCegarLoop]: Abstraction has 13883 states and 20100 transitions. [2018-12-01 18:35:34,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 18:35:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13883 states and 20100 transitions. [2018-12-01 18:35:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-01 18:35:34,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:34,155 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 18:35:34,155 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:34,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:34,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1356313327, now seen corresponding path program 1 times [2018-12-01 18:35:34,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:34,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:34,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:34,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:34,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:35:34,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:34,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 18:35:34,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 18:35:34,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 18:35:34,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-01 18:35:34,316 INFO L87 Difference]: Start difference. First operand 13883 states and 20100 transitions. Second operand 13 states. [2018-12-01 18:35:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:34,941 INFO L93 Difference]: Finished difference Result 14066 states and 20357 transitions. [2018-12-01 18:35:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 18:35:34,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-01 18:35:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:34,964 INFO L225 Difference]: With dead ends: 14066 [2018-12-01 18:35:34,964 INFO L226 Difference]: Without dead ends: 14047 [2018-12-01 18:35:34,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-01 18:35:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14047 states. [2018-12-01 18:35:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14047 to 13891. [2018-12-01 18:35:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13891 states. [2018-12-01 18:35:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13891 states to 13891 states and 20108 transitions. [2018-12-01 18:35:35,216 INFO L78 Accepts]: Start accepts. Automaton has 13891 states and 20108 transitions. Word has length 115 [2018-12-01 18:35:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:35,216 INFO L480 AbstractCegarLoop]: Abstraction has 13891 states and 20108 transitions. [2018-12-01 18:35:35,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 18:35:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 13891 states and 20108 transitions. [2018-12-01 18:35:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-01 18:35:35,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:35,218 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:35:35,218 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:35,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:35,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1738777831, now seen corresponding path program 1 times [2018-12-01 18:35:35,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:35,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:35,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:35:35,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:35,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 18:35:35,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 18:35:35,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 18:35:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-01 18:35:35,379 INFO L87 Difference]: Start difference. First operand 13891 states and 20108 transitions. Second operand 13 states. [2018-12-01 18:35:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:35,994 INFO L93 Difference]: Finished difference Result 14074 states and 20365 transitions. [2018-12-01 18:35:35,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 18:35:35,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-12-01 18:35:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:36,017 INFO L225 Difference]: With dead ends: 14074 [2018-12-01 18:35:36,017 INFO L226 Difference]: Without dead ends: 14055 [2018-12-01 18:35:36,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-01 18:35:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14055 states. [2018-12-01 18:35:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14055 to 13899. [2018-12-01 18:35:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13899 states. [2018-12-01 18:35:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13899 states to 13899 states and 20116 transitions. [2018-12-01 18:35:36,308 INFO L78 Accepts]: Start accepts. Automaton has 13899 states and 20116 transitions. Word has length 116 [2018-12-01 18:35:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:36,308 INFO L480 AbstractCegarLoop]: Abstraction has 13899 states and 20116 transitions. [2018-12-01 18:35:36,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 18:35:36,308 INFO L276 IsEmpty]: Start isEmpty. Operand 13899 states and 20116 transitions. [2018-12-01 18:35:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-01 18:35:36,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:36,310 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] [2018-12-01 18:35:36,310 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:36,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash -363944037, now seen corresponding path program 1 times [2018-12-01 18:35:36,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:36,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:36,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:36,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:36,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:36,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:36,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 18:35:36,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 18:35:36,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 18:35:36,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 18:35:36,411 INFO L87 Difference]: Start difference. First operand 13899 states and 20116 transitions. Second operand 6 states. [2018-12-01 18:35:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:36,727 INFO L93 Difference]: Finished difference Result 27952 states and 41798 transitions. [2018-12-01 18:35:36,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 18:35:36,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-12-01 18:35:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:36,757 INFO L225 Difference]: With dead ends: 27952 [2018-12-01 18:35:36,757 INFO L226 Difference]: Without dead ends: 14123 [2018-12-01 18:35:36,788 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-12-01 18:35:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14123 states. [2018-12-01 18:35:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14123 to 14075. [2018-12-01 18:35:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14075 states. [2018-12-01 18:35:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14075 states to 14075 states and 20602 transitions. [2018-12-01 18:35:37,040 INFO L78 Accepts]: Start accepts. Automaton has 14075 states and 20602 transitions. Word has length 124 [2018-12-01 18:35:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:37,040 INFO L480 AbstractCegarLoop]: Abstraction has 14075 states and 20602 transitions. [2018-12-01 18:35:37,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 18:35:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 14075 states and 20602 transitions. [2018-12-01 18:35:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-01 18:35:37,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:37,042 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] [2018-12-01 18:35:37,042 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:37,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1020549295, now seen corresponding path program 1 times [2018-12-01 18:35:37,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:37,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:37,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:37,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 18:35:37,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 18:35:37,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 18:35:37,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 18:35:37,125 INFO L87 Difference]: Start difference. First operand 14075 states and 20602 transitions. Second operand 6 states. [2018-12-01 18:35:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:37,492 INFO L93 Difference]: Finished difference Result 28340 states and 42841 transitions. [2018-12-01 18:35:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 18:35:37,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-01 18:35:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:37,524 INFO L225 Difference]: With dead ends: 28340 [2018-12-01 18:35:37,524 INFO L226 Difference]: Without dead ends: 14335 [2018-12-01 18:35:37,561 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-12-01 18:35:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14335 states. [2018-12-01 18:35:37,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14335 to 14217. [2018-12-01 18:35:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14217 states. [2018-12-01 18:35:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14217 states to 14217 states and 20911 transitions. [2018-12-01 18:35:37,824 INFO L78 Accepts]: Start accepts. Automaton has 14217 states and 20911 transitions. Word has length 125 [2018-12-01 18:35:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:37,824 INFO L480 AbstractCegarLoop]: Abstraction has 14217 states and 20911 transitions. [2018-12-01 18:35:37,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 18:35:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 14217 states and 20911 transitions. [2018-12-01 18:35:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-01 18:35:37,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:37,826 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:35:37,826 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:37,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:37,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1228202997, now seen corresponding path program 1 times [2018-12-01 18:35:37,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:37,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:37,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:37,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:37,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-01 18:35:37,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:35:37,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/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-12-01 18:35:37,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:38,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:35:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 18:35:38,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 18:35:38,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-12-01 18:35:38,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 18:35:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 18:35:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 18:35:38,278 INFO L87 Difference]: Start difference. First operand 14217 states and 20911 transitions. Second operand 8 states. [2018-12-01 18:35:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:38,944 INFO L93 Difference]: Finished difference Result 28652 states and 43751 transitions. [2018-12-01 18:35:38,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 18:35:38,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2018-12-01 18:35:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:38,993 INFO L225 Difference]: With dead ends: 28652 [2018-12-01 18:35:38,993 INFO L226 Difference]: Without dead ends: 14505 [2018-12-01 18:35:39,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-01 18:35:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14505 states. [2018-12-01 18:35:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14505 to 14361. [2018-12-01 18:35:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14361 states. [2018-12-01 18:35:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14361 states to 14361 states and 21127 transitions. [2018-12-01 18:35:39,634 INFO L78 Accepts]: Start accepts. Automaton has 14361 states and 21127 transitions. Word has length 122 [2018-12-01 18:35:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:39,635 INFO L480 AbstractCegarLoop]: Abstraction has 14361 states and 21127 transitions. [2018-12-01 18:35:39,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 18:35:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 14361 states and 21127 transitions. [2018-12-01 18:35:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-01 18:35:39,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:39,638 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] [2018-12-01 18:35:39,638 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:39,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1920718050, now seen corresponding path program 1 times [2018-12-01 18:35:39,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:39,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:39,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:39,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:39,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:39,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:39,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:39,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:39,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:39,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:39,735 INFO L87 Difference]: Start difference. First operand 14361 states and 21127 transitions. Second operand 3 states. [2018-12-01 18:35:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:40,389 INFO L93 Difference]: Finished difference Result 32236 states and 49909 transitions. [2018-12-01 18:35:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:40,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-12-01 18:35:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:40,449 INFO L225 Difference]: With dead ends: 32236 [2018-12-01 18:35:40,449 INFO L226 Difference]: Without dead ends: 17945 [2018-12-01 18:35:40,493 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-12-01 18:35:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17945 states. [2018-12-01 18:35:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17945 to 17907. [2018-12-01 18:35:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17907 states. [2018-12-01 18:35:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17907 states to 17907 states and 27284 transitions. [2018-12-01 18:35:40,907 INFO L78 Accepts]: Start accepts. Automaton has 17907 states and 27284 transitions. Word has length 125 [2018-12-01 18:35:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:40,908 INFO L480 AbstractCegarLoop]: Abstraction has 17907 states and 27284 transitions. [2018-12-01 18:35:40,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17907 states and 27284 transitions. [2018-12-01 18:35:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-01 18:35:40,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:40,910 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:35:40,911 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:40,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1457285803, now seen corresponding path program 1 times [2018-12-01 18:35:40,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:40,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-01 18:35:41,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:41,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 18:35:41,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 18:35:41,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 18:35:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 18:35:41,056 INFO L87 Difference]: Start difference. First operand 17907 states and 27284 transitions. Second operand 9 states. [2018-12-01 18:35:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:41,413 INFO L93 Difference]: Finished difference Result 18473 states and 28791 transitions. [2018-12-01 18:35:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 18:35:41,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-12-01 18:35:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:41,454 INFO L225 Difference]: With dead ends: 18473 [2018-12-01 18:35:41,454 INFO L226 Difference]: Without dead ends: 18391 [2018-12-01 18:35:41,461 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-12-01 18:35:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18391 states. [2018-12-01 18:35:41,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18391 to 18247. [2018-12-01 18:35:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2018-12-01 18:35:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 28354 transitions. [2018-12-01 18:35:41,867 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 28354 transitions. Word has length 134 [2018-12-01 18:35:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:41,868 INFO L480 AbstractCegarLoop]: Abstraction has 18247 states and 28354 transitions. [2018-12-01 18:35:41,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 18:35:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 28354 transitions. [2018-12-01 18:35:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-01 18:35:41,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:41,870 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-12-01 18:35:41,870 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:41,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2101883920, now seen corresponding path program 1 times [2018-12-01 18:35:41,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:41,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:41,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:41,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:41,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 18:35:42,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:42,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 18:35:42,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 18:35:42,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 18:35:42,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 18:35:42,028 INFO L87 Difference]: Start difference. First operand 18247 states and 28354 transitions. Second operand 12 states. [2018-12-01 18:35:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:42,411 INFO L93 Difference]: Finished difference Result 18411 states and 28566 transitions. [2018-12-01 18:35:42,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 18:35:42,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-12-01 18:35:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:42,449 INFO L225 Difference]: With dead ends: 18411 [2018-12-01 18:35:42,449 INFO L226 Difference]: Without dead ends: 18384 [2018-12-01 18:35:42,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-01 18:35:42,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18384 states. [2018-12-01 18:35:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18384 to 18309. [2018-12-01 18:35:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18309 states. [2018-12-01 18:35:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18309 states to 18309 states and 28408 transitions. [2018-12-01 18:35:42,918 INFO L78 Accepts]: Start accepts. Automaton has 18309 states and 28408 transitions. Word has length 130 [2018-12-01 18:35:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:42,919 INFO L480 AbstractCegarLoop]: Abstraction has 18309 states and 28408 transitions. [2018-12-01 18:35:42,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 18:35:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 18309 states and 28408 transitions. [2018-12-01 18:35:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-01 18:35:42,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:42,921 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] [2018-12-01 18:35:42,921 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:42,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:42,921 INFO L82 PathProgramCache]: Analyzing trace with hash 165704108, now seen corresponding path program 1 times [2018-12-01 18:35:42,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:42,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:42,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:42,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:43,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:43,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:43,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:43,003 INFO L87 Difference]: Start difference. First operand 18309 states and 28408 transitions. Second operand 3 states. [2018-12-01 18:35:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:43,464 INFO L93 Difference]: Finished difference Result 36727 states and 59897 transitions. [2018-12-01 18:35:43,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:43,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-12-01 18:35:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:43,518 INFO L225 Difference]: With dead ends: 36727 [2018-12-01 18:35:43,518 INFO L226 Difference]: Without dead ends: 18481 [2018-12-01 18:35:43,583 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-12-01 18:35:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18481 states. [2018-12-01 18:35:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18481 to 18333. [2018-12-01 18:35:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18333 states. [2018-12-01 18:35:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18333 states to 18333 states and 28448 transitions. [2018-12-01 18:35:43,992 INFO L78 Accepts]: Start accepts. Automaton has 18333 states and 28448 transitions. Word has length 132 [2018-12-01 18:35:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:43,993 INFO L480 AbstractCegarLoop]: Abstraction has 18333 states and 28448 transitions. [2018-12-01 18:35:43,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 18333 states and 28448 transitions. [2018-12-01 18:35:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-01 18:35:43,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:43,995 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] [2018-12-01 18:35:43,995 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:43,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1885066274, now seen corresponding path program 1 times [2018-12-01 18:35:43,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:43,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:43,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:43,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:35:44,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:44,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:35:44,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:35:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:35:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:35:44,085 INFO L87 Difference]: Start difference. First operand 18333 states and 28448 transitions. Second operand 3 states. [2018-12-01 18:35:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:44,531 INFO L93 Difference]: Finished difference Result 30333 states and 48646 transitions. [2018-12-01 18:35:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:35:44,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-12-01 18:35:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:44,585 INFO L225 Difference]: With dead ends: 30333 [2018-12-01 18:35:44,585 INFO L226 Difference]: Without dead ends: 21071 [2018-12-01 18:35:44,624 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-12-01 18:35:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21071 states. [2018-12-01 18:35:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21071 to 20862. [2018-12-01 18:35:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20862 states. [2018-12-01 18:35:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20862 states to 20862 states and 32591 transitions. [2018-12-01 18:35:45,115 INFO L78 Accepts]: Start accepts. Automaton has 20862 states and 32591 transitions. Word has length 133 [2018-12-01 18:35:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:45,115 INFO L480 AbstractCegarLoop]: Abstraction has 20862 states and 32591 transitions. [2018-12-01 18:35:45,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:35:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 20862 states and 32591 transitions. [2018-12-01 18:35:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-01 18:35:45,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:45,117 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:35:45,117 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:45,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 446279291, now seen corresponding path program 1 times [2018-12-01 18:35:45,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:45,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:45,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:45,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:45,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-01 18:35:45,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:35:45,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 18:35:45,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 18:35:45,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 18:35:45,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 18:35:45,214 INFO L87 Difference]: Start difference. First operand 20862 states and 32591 transitions. Second operand 7 states. [2018-12-01 18:35:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:35:45,816 INFO L93 Difference]: Finished difference Result 41687 states and 65142 transitions. [2018-12-01 18:35:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 18:35:45,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-12-01 18:35:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:35:45,873 INFO L225 Difference]: With dead ends: 41687 [2018-12-01 18:35:45,873 INFO L226 Difference]: Without dead ends: 20862 [2018-12-01 18:35:45,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 18:35:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20862 states. [2018-12-01 18:35:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20862 to 20862. [2018-12-01 18:35:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20862 states. [2018-12-01 18:35:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20862 states to 20862 states and 32590 transitions. [2018-12-01 18:35:46,434 INFO L78 Accepts]: Start accepts. Automaton has 20862 states and 32590 transitions. Word has length 132 [2018-12-01 18:35:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:35:46,435 INFO L480 AbstractCegarLoop]: Abstraction has 20862 states and 32590 transitions. [2018-12-01 18:35:46,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 18:35:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20862 states and 32590 transitions. [2018-12-01 18:35:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 18:35:46,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:35:46,437 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-12-01 18:35:46,437 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:35:46,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:35:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash 582236560, now seen corresponding path program 1 times [2018-12-01 18:35:46,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:35:46,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:35:46,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:46,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:46,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:35:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 18:35:46,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:35:46,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/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-12-01 18:35:46,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:35:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:35:46,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:35:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:35:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 18:35:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-01 18:35:47,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 18:35:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 18:35:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-01 18:35:47,031 INFO L87 Difference]: Start difference. First operand 20862 states and 32590 transitions. Second operand 10 states. [2018-12-01 18:36:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:36:19,016 INFO L93 Difference]: Finished difference Result 106303 states and 208096 transitions. [2018-12-01 18:36:19,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 18:36:19,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-12-01 18:36:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:36:19,380 INFO L225 Difference]: With dead ends: 106303 [2018-12-01 18:36:19,380 INFO L226 Difference]: Without dead ends: 85504 [2018-12-01 18:36:19,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-12-01 18:36:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85504 states. [2018-12-01 18:36:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85504 to 83106. [2018-12-01 18:36:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83106 states. [2018-12-01 18:36:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83106 states to 83106 states and 156576 transitions. [2018-12-01 18:36:22,560 INFO L78 Accepts]: Start accepts. Automaton has 83106 states and 156576 transitions. Word has length 146 [2018-12-01 18:36:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:36:22,560 INFO L480 AbstractCegarLoop]: Abstraction has 83106 states and 156576 transitions. [2018-12-01 18:36:22,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 18:36:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 83106 states and 156576 transitions. [2018-12-01 18:36:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-01 18:36:22,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:36:22,563 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-12-01 18:36:22,563 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:36:22,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:36:22,563 INFO L82 PathProgramCache]: Analyzing trace with hash -650794510, now seen corresponding path program 1 times [2018-12-01 18:36:22,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:36:22,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:36:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:22,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-01 18:36:23,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:36:23,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/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-12-01 18:36:23,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:23,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:36:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 18:36:23,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 18:36:23,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 10 [2018-12-01 18:36:23,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 18:36:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 18:36:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-01 18:36:23,637 INFO L87 Difference]: Start difference. First operand 83106 states and 156576 transitions. Second operand 10 states. [2018-12-01 18:36:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:36:53,394 INFO L93 Difference]: Finished difference Result 85878 states and 160445 transitions. [2018-12-01 18:36:53,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 18:36:53,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2018-12-01 18:36:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:36:53,402 INFO L225 Difference]: With dead ends: 85878 [2018-12-01 18:36:53,402 INFO L226 Difference]: Without dead ends: 1984 [2018-12-01 18:36:53,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-01 18:36:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2018-12-01 18:36:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1552. [2018-12-01 18:36:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2018-12-01 18:36:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1870 transitions. [2018-12-01 18:36:53,743 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1870 transitions. Word has length 155 [2018-12-01 18:36:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:36:53,743 INFO L480 AbstractCegarLoop]: Abstraction has 1552 states and 1870 transitions. [2018-12-01 18:36:53,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 18:36:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1870 transitions. [2018-12-01 18:36:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-01 18:36:53,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:36:53,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:36:53,745 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:36:53,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:36:53,745 INFO L82 PathProgramCache]: Analyzing trace with hash -33736476, now seen corresponding path program 1 times [2018-12-01 18:36:53,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:36:53,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:36:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:53,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-01 18:36:54,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:36:54,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 18:36:54,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 18:36:54,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 18:36:54,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:36:54,427 INFO L87 Difference]: Start difference. First operand 1552 states and 1870 transitions. Second operand 5 states. [2018-12-01 18:36:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:36:54,510 INFO L93 Difference]: Finished difference Result 1939 states and 2302 transitions. [2018-12-01 18:36:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 18:36:54,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2018-12-01 18:36:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:36:54,514 INFO L225 Difference]: With dead ends: 1939 [2018-12-01 18:36:54,514 INFO L226 Difference]: Without dead ends: 1573 [2018-12-01 18:36:54,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:36:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2018-12-01 18:36:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1555. [2018-12-01 18:36:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-12-01 18:36:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1874 transitions. [2018-12-01 18:36:54,549 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1874 transitions. Word has length 165 [2018-12-01 18:36:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:36:54,549 INFO L480 AbstractCegarLoop]: Abstraction has 1555 states and 1874 transitions. [2018-12-01 18:36:54,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 18:36:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1874 transitions. [2018-12-01 18:36:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-01 18:36:54,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:36:54,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:36:54,551 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:36:54,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:36:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash -499319691, now seen corresponding path program 1 times [2018-12-01 18:36:54,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:36:54,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:36:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:54,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-01 18:36:54,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:36:54,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:36:54,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:36:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:36:54,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:36:54,758 INFO L87 Difference]: Start difference. First operand 1555 states and 1874 transitions. Second operand 4 states. [2018-12-01 18:36:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:36:54,908 INFO L93 Difference]: Finished difference Result 2597 states and 3166 transitions. [2018-12-01 18:36:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:36:54,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-01 18:36:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:36:54,914 INFO L225 Difference]: With dead ends: 2597 [2018-12-01 18:36:54,914 INFO L226 Difference]: Without dead ends: 1559 [2018-12-01 18:36:54,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:36:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2018-12-01 18:36:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1557. [2018-12-01 18:36:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2018-12-01 18:36:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1877 transitions. [2018-12-01 18:36:54,950 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1877 transitions. Word has length 166 [2018-12-01 18:36:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:36:54,950 INFO L480 AbstractCegarLoop]: Abstraction has 1557 states and 1877 transitions. [2018-12-01 18:36:54,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:36:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1877 transitions. [2018-12-01 18:36:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-01 18:36:54,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:36:54,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:36:54,952 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:36:54,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:36:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash -189696958, now seen corresponding path program 1 times [2018-12-01 18:36:54,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:36:54,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:36:54,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:54,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:54,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-01 18:36:55,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:36:55,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/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-12-01 18:36:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:55,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:36:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 18:36:55,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 18:36:55,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-12-01 18:36:55,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 18:36:55,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 18:36:55,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-01 18:36:55,656 INFO L87 Difference]: Start difference. First operand 1557 states and 1877 transitions. Second operand 12 states. [2018-12-01 18:36:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:36:56,452 INFO L93 Difference]: Finished difference Result 2594 states and 3185 transitions. [2018-12-01 18:36:56,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 18:36:56,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 167 [2018-12-01 18:36:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:36:56,456 INFO L225 Difference]: With dead ends: 2594 [2018-12-01 18:36:56,456 INFO L226 Difference]: Without dead ends: 1557 [2018-12-01 18:36:56,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-01 18:36:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2018-12-01 18:36:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1532. [2018-12-01 18:36:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1532 states. [2018-12-01 18:36:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1831 transitions. [2018-12-01 18:36:56,492 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1831 transitions. Word has length 167 [2018-12-01 18:36:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:36:56,493 INFO L480 AbstractCegarLoop]: Abstraction has 1532 states and 1831 transitions. [2018-12-01 18:36:56,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 18:36:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1831 transitions. [2018-12-01 18:36:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-01 18:36:56,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:36:56,494 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:36:56,494 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:36:56,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:36:56,494 INFO L82 PathProgramCache]: Analyzing trace with hash -569071880, now seen corresponding path program 1 times [2018-12-01 18:36:56,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:36:56,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:36:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:56,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:56,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-01 18:36:56,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:36:56,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 18:36:56,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 18:36:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 18:36:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 18:36:56,644 INFO L87 Difference]: Start difference. First operand 1532 states and 1831 transitions. Second operand 6 states. [2018-12-01 18:36:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:36:56,722 INFO L93 Difference]: Finished difference Result 2185 states and 2609 transitions. [2018-12-01 18:36:56,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 18:36:56,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-12-01 18:36:56,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:36:56,725 INFO L225 Difference]: With dead ends: 2185 [2018-12-01 18:36:56,725 INFO L226 Difference]: Without dead ends: 1542 [2018-12-01 18:36:56,726 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-12-01 18:36:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-01 18:36:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1502. [2018-12-01 18:36:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2018-12-01 18:36:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1789 transitions. [2018-12-01 18:36:56,760 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1789 transitions. Word has length 175 [2018-12-01 18:36:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:36:56,760 INFO L480 AbstractCegarLoop]: Abstraction has 1502 states and 1789 transitions. [2018-12-01 18:36:56,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 18:36:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1789 transitions. [2018-12-01 18:36:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-01 18:36:56,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:36:56,761 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:36:56,761 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:36:56,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:36:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash -718283004, now seen corresponding path program 1 times [2018-12-01 18:36:56,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:36:56,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:36:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:56,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-01 18:36:56,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:36:56,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 18:36:56,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 18:36:56,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 18:36:56,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 18:36:56,883 INFO L87 Difference]: Start difference. First operand 1502 states and 1789 transitions. Second operand 6 states. [2018-12-01 18:36:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:36:56,967 INFO L93 Difference]: Finished difference Result 2254 states and 2661 transitions. [2018-12-01 18:36:56,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 18:36:56,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-12-01 18:36:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:36:56,970 INFO L225 Difference]: With dead ends: 2254 [2018-12-01 18:36:56,970 INFO L226 Difference]: Without dead ends: 1471 [2018-12-01 18:36:56,971 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-12-01 18:36:56,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2018-12-01 18:36:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1433. [2018-12-01 18:36:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-12-01 18:36:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1694 transitions. [2018-12-01 18:36:57,006 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1694 transitions. Word has length 172 [2018-12-01 18:36:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:36:57,006 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 1694 transitions. [2018-12-01 18:36:57,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 18:36:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1694 transitions. [2018-12-01 18:36:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-01 18:36:57,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:36:57,007 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-12-01 18:36:57,007 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:36:57,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:36:57,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1455766763, now seen corresponding path program 1 times [2018-12-01 18:36:57,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:36:57,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:36:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:57,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-01 18:36:57,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:36:57,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 18:36:57,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 18:36:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 18:36:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:36:57,095 INFO L87 Difference]: Start difference. First operand 1433 states and 1694 transitions. Second operand 5 states. [2018-12-01 18:36:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:36:57,143 INFO L93 Difference]: Finished difference Result 1498 states and 1760 transitions. [2018-12-01 18:36:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 18:36:57,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2018-12-01 18:36:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:36:57,145 INFO L225 Difference]: With dead ends: 1498 [2018-12-01 18:36:57,145 INFO L226 Difference]: Without dead ends: 1405 [2018-12-01 18:36:57,145 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-12-01 18:36:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2018-12-01 18:36:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2018-12-01 18:36:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2018-12-01 18:36:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1660 transitions. [2018-12-01 18:36:57,179 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1660 transitions. Word has length 175 [2018-12-01 18:36:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:36:57,179 INFO L480 AbstractCegarLoop]: Abstraction has 1405 states and 1660 transitions. [2018-12-01 18:36:57,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 18:36:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1660 transitions. [2018-12-01 18:36:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-01 18:36:57,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:36:57,181 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:36:57,181 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:36:57,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:36:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1166485477, now seen corresponding path program 1 times [2018-12-01 18:36:57,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:36:57,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:36:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:57,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:36:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:36:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:36:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-01 18:36:57,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:36:57,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 18:36:57,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 18:36:57,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 18:36:57,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:36:57,303 INFO L87 Difference]: Start difference. First operand 1405 states and 1660 transitions. Second operand 5 states. [2018-12-01 18:37:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:37:09,372 INFO L93 Difference]: Finished difference Result 2011 states and 2359 transitions. [2018-12-01 18:37:09,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 18:37:09,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-01 18:37:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:37:09,374 INFO L225 Difference]: With dead ends: 2011 [2018-12-01 18:37:09,374 INFO L226 Difference]: Without dead ends: 1115 [2018-12-01 18:37:09,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 18:37:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-12-01 18:37:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 915. [2018-12-01 18:37:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-12-01 18:37:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1047 transitions. [2018-12-01 18:37:09,400 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1047 transitions. Word has length 185 [2018-12-01 18:37:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:37:09,400 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1047 transitions. [2018-12-01 18:37:09,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 18:37:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1047 transitions. [2018-12-01 18:37:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-01 18:37:09,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:37:09,401 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 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-12-01 18:37:09,402 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:37:09,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:37:09,402 INFO L82 PathProgramCache]: Analyzing trace with hash 700859628, now seen corresponding path program 1 times [2018-12-01 18:37:09,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:37:09,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:37:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:37:09,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:37:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:37:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:37:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-01 18:37:09,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:37:09,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 18:37:09,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 18:37:09,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 18:37:09,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 18:37:09,512 INFO L87 Difference]: Start difference. First operand 915 states and 1047 transitions. Second operand 6 states. [2018-12-01 18:37:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:37:09,563 INFO L93 Difference]: Finished difference Result 943 states and 1074 transitions. [2018-12-01 18:37:09,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 18:37:09,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-12-01 18:37:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:37:09,565 INFO L225 Difference]: With dead ends: 943 [2018-12-01 18:37:09,565 INFO L226 Difference]: Without dead ends: 845 [2018-12-01 18:37:09,565 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-12-01 18:37:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-12-01 18:37:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 821. [2018-12-01 18:37:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-01 18:37:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 932 transitions. [2018-12-01 18:37:09,587 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 932 transitions. Word has length 204 [2018-12-01 18:37:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:37:09,587 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 932 transitions. [2018-12-01 18:37:09,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 18:37:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 932 transitions. [2018-12-01 18:37:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-01 18:37:09,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:37:09,588 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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-12-01 18:37:09,589 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:37:09,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:37:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash 465490928, now seen corresponding path program 1 times [2018-12-01 18:37:09,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:37:09,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:37:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:37:09,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:37:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:37:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:37:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-01 18:37:09,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:37:09,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 18:37:09,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 18:37:09,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 18:37:09,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-01 18:37:09,777 INFO L87 Difference]: Start difference. First operand 821 states and 932 transitions. Second operand 13 states. [2018-12-01 18:37:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:37:10,400 INFO L93 Difference]: Finished difference Result 848 states and 962 transitions. [2018-12-01 18:37:10,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 18:37:10,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2018-12-01 18:37:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:37:10,401 INFO L225 Difference]: With dead ends: 848 [2018-12-01 18:37:10,401 INFO L226 Difference]: Without dead ends: 723 [2018-12-01 18:37:10,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-01 18:37:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-01 18:37:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2018-12-01 18:37:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-12-01 18:37:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 821 transitions. [2018-12-01 18:37:10,425 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 821 transitions. Word has length 194 [2018-12-01 18:37:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:37:10,425 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 821 transitions. [2018-12-01 18:37:10,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 18:37:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 821 transitions. [2018-12-01 18:37:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-01 18:37:10,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:37:10,426 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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-12-01 18:37:10,426 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:37:10,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:37:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1668071764, now seen corresponding path program 1 times [2018-12-01 18:37:10,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:37:10,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:37:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:37:10,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:37:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:37:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:37:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-01 18:37:10,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:37:10,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-01 18:37:10,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-01 18:37:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-01 18:37:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-12-01 18:37:10,648 INFO L87 Difference]: Start difference. First operand 723 states and 821 transitions. Second operand 15 states. [2018-12-01 18:38:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:10,598 INFO L93 Difference]: Finished difference Result 1530 states and 1720 transitions. [2018-12-01 18:38:10,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-01 18:38:10,599 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 198 [2018-12-01 18:38:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:10,602 INFO L225 Difference]: With dead ends: 1530 [2018-12-01 18:38:10,602 INFO L226 Difference]: Without dead ends: 1092 [2018-12-01 18:38:10,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2018-12-01 18:38:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2018-12-01 18:38:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 878. [2018-12-01 18:38:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-12-01 18:38:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 993 transitions. [2018-12-01 18:38:10,645 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 993 transitions. Word has length 198 [2018-12-01 18:38:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:10,646 INFO L480 AbstractCegarLoop]: Abstraction has 878 states and 993 transitions. [2018-12-01 18:38:10,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-01 18:38:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 993 transitions. [2018-12-01 18:38:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-01 18:38:10,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:10,647 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 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-12-01 18:38:10,647 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:10,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1733124513, now seen corresponding path program 1 times [2018-12-01 18:38:10,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:10,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:10,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:10,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-01 18:38:10,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:10,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:38:10,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 18:38:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:38:10,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:38:10,741 INFO L87 Difference]: Start difference. First operand 878 states and 993 transitions. Second operand 3 states. [2018-12-01 18:38:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:10,805 INFO L93 Difference]: Finished difference Result 897 states and 1012 transitions. [2018-12-01 18:38:10,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:38:10,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-12-01 18:38:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:10,806 INFO L225 Difference]: With dead ends: 897 [2018-12-01 18:38:10,806 INFO L226 Difference]: Without dead ends: 727 [2018-12-01 18:38:10,806 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-12-01 18:38:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-01 18:38:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-12-01 18:38:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-12-01 18:38:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 827 transitions. [2018-12-01 18:38:10,830 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 827 transitions. Word has length 199 [2018-12-01 18:38:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:10,830 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 827 transitions. [2018-12-01 18:38:10,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 18:38:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 827 transitions. [2018-12-01 18:38:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-01 18:38:10,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:10,831 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:10,831 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:10,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash 268875819, now seen corresponding path program 1 times [2018-12-01 18:38:10,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:10,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 18:38:11,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:11,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 18:38:11,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 18:38:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 18:38:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 18:38:11,009 INFO L87 Difference]: Start difference. First operand 727 states and 827 transitions. Second operand 12 states. [2018-12-01 18:38:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:11,174 INFO L93 Difference]: Finished difference Result 810 states and 939 transitions. [2018-12-01 18:38:11,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 18:38:11,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 212 [2018-12-01 18:38:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:11,176 INFO L225 Difference]: With dead ends: 810 [2018-12-01 18:38:11,176 INFO L226 Difference]: Without dead ends: 744 [2018-12-01 18:38:11,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-01 18:38:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-12-01 18:38:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 733. [2018-12-01 18:38:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-12-01 18:38:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 828 transitions. [2018-12-01 18:38:11,200 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 828 transitions. Word has length 212 [2018-12-01 18:38:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:11,200 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 828 transitions. [2018-12-01 18:38:11,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 18:38:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 828 transitions. [2018-12-01 18:38:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-01 18:38:11,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:11,201 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:11,201 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:11,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:11,202 INFO L82 PathProgramCache]: Analyzing trace with hash -715571839, now seen corresponding path program 1 times [2018-12-01 18:38:11,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:11,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:11,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:11,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:11,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-01 18:38:11,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:11,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 18:38:11,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 18:38:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 18:38:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-01 18:38:11,373 INFO L87 Difference]: Start difference. First operand 733 states and 828 transitions. Second operand 13 states. [2018-12-01 18:38:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:11,508 INFO L93 Difference]: Finished difference Result 860 states and 967 transitions. [2018-12-01 18:38:11,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 18:38:11,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 212 [2018-12-01 18:38:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:11,509 INFO L225 Difference]: With dead ends: 860 [2018-12-01 18:38:11,510 INFO L226 Difference]: Without dead ends: 746 [2018-12-01 18:38:11,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-01 18:38:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-01 18:38:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 737. [2018-12-01 18:38:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-01 18:38:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 832 transitions. [2018-12-01 18:38:11,536 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 832 transitions. Word has length 212 [2018-12-01 18:38:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:11,536 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 832 transitions. [2018-12-01 18:38:11,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 18:38:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 832 transitions. [2018-12-01 18:38:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-01 18:38:11,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:11,537 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:11,537 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:11,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:11,538 INFO L82 PathProgramCache]: Analyzing trace with hash 215208960, now seen corresponding path program 1 times [2018-12-01 18:38:11,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:11,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:11,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-01 18:38:11,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:11,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 18:38:11,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 18:38:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 18:38:11,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-01 18:38:11,719 INFO L87 Difference]: Start difference. First operand 737 states and 832 transitions. Second operand 13 states. [2018-12-01 18:38:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:12,152 INFO L93 Difference]: Finished difference Result 741 states and 835 transitions. [2018-12-01 18:38:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 18:38:12,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 212 [2018-12-01 18:38:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:12,154 INFO L225 Difference]: With dead ends: 741 [2018-12-01 18:38:12,154 INFO L226 Difference]: Without dead ends: 563 [2018-12-01 18:38:12,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-01 18:38:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-12-01 18:38:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2018-12-01 18:38:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-12-01 18:38:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 634 transitions. [2018-12-01 18:38:12,177 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 634 transitions. Word has length 212 [2018-12-01 18:38:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:12,177 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 634 transitions. [2018-12-01 18:38:12,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 18:38:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 634 transitions. [2018-12-01 18:38:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-01 18:38:12,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:12,178 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:12,178 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:12,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:12,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1878163309, now seen corresponding path program 1 times [2018-12-01 18:38:12,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:12,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:12,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-01 18:38:12,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:12,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 18:38:12,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 18:38:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 18:38:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-01 18:38:12,334 INFO L87 Difference]: Start difference. First operand 563 states and 634 transitions. Second operand 10 states. [2018-12-01 18:38:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:12,617 INFO L93 Difference]: Finished difference Result 1049 states and 1181 transitions. [2018-12-01 18:38:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 18:38:12,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-12-01 18:38:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:12,620 INFO L225 Difference]: With dead ends: 1049 [2018-12-01 18:38:12,620 INFO L226 Difference]: Without dead ends: 949 [2018-12-01 18:38:12,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-01 18:38:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-12-01 18:38:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 425. [2018-12-01 18:38:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-01 18:38:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2018-12-01 18:38:12,641 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 462 transitions. Word has length 221 [2018-12-01 18:38:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:12,641 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 462 transitions. [2018-12-01 18:38:12,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 18:38:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 462 transitions. [2018-12-01 18:38:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-01 18:38:12,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:12,642 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:12,642 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:12,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1990034264, now seen corresponding path program 1 times [2018-12-01 18:38:12,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:12,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:12,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 18:38:12,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:12,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:38:12,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 18:38:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:38:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:38:12,746 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand 4 states. [2018-12-01 18:38:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:12,880 INFO L93 Difference]: Finished difference Result 557 states and 608 transitions. [2018-12-01 18:38:12,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 18:38:12,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2018-12-01 18:38:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:12,882 INFO L225 Difference]: With dead ends: 557 [2018-12-01 18:38:12,882 INFO L226 Difference]: Without dead ends: 450 [2018-12-01 18:38:12,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:38:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-01 18:38:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 422. [2018-12-01 18:38:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-01 18:38:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 458 transitions. [2018-12-01 18:38:12,899 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 458 transitions. Word has length 253 [2018-12-01 18:38:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:12,899 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 458 transitions. [2018-12-01 18:38:12,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 18:38:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 458 transitions. [2018-12-01 18:38:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-01 18:38:12,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:12,900 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:12,900 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:12,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1326550120, now seen corresponding path program 1 times [2018-12-01 18:38:12,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:12,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:12,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 18:38:13,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:13,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 18:38:13,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 18:38:13,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 18:38:13,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:38:13,014 INFO L87 Difference]: Start difference. First operand 422 states and 458 transitions. Second operand 5 states. [2018-12-01 18:38:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:13,043 INFO L93 Difference]: Finished difference Result 515 states and 553 transitions. [2018-12-01 18:38:13,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 18:38:13,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2018-12-01 18:38:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:13,044 INFO L225 Difference]: With dead ends: 515 [2018-12-01 18:38:13,044 INFO L226 Difference]: Without dead ends: 428 [2018-12-01 18:38:13,044 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-12-01 18:38:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-01 18:38:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2018-12-01 18:38:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-12-01 18:38:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 462 transitions. [2018-12-01 18:38:13,061 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 462 transitions. Word has length 255 [2018-12-01 18:38:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:13,061 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 462 transitions. [2018-12-01 18:38:13,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 18:38:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 462 transitions. [2018-12-01 18:38:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-01 18:38:13,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:13,062 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:13,062 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:13,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash -473983657, now seen corresponding path program 1 times [2018-12-01 18:38:13,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:13,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:13,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:13,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:13,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 18:38:13,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:13,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 18:38:13,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 18:38:13,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 18:38:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 18:38:13,177 INFO L87 Difference]: Start difference. First operand 426 states and 462 transitions. Second operand 5 states. [2018-12-01 18:38:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:13,219 INFO L93 Difference]: Finished difference Result 579 states and 631 transitions. [2018-12-01 18:38:13,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 18:38:13,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2018-12-01 18:38:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:13,221 INFO L225 Difference]: With dead ends: 579 [2018-12-01 18:38:13,221 INFO L226 Difference]: Without dead ends: 424 [2018-12-01 18:38:13,221 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-12-01 18:38:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-01 18:38:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-12-01 18:38:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-01 18:38:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-12-01 18:38:13,238 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 255 [2018-12-01 18:38:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:13,238 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-12-01 18:38:13,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 18:38:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-12-01 18:38:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-12-01 18:38:13,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:13,239 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:13,239 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:13,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:13,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1472757941, now seen corresponding path program 1 times [2018-12-01 18:38:13,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:13,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:13,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:13,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:13,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-01 18:38:13,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:38:13,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-01 18:38:13,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-01 18:38:13,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-01 18:38:13,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-01 18:38:13,474 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 14 states. [2018-12-01 18:38:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:15,670 INFO L93 Difference]: Finished difference Result 490 states and 541 transitions. [2018-12-01 18:38:15,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 18:38:15,671 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 287 [2018-12-01 18:38:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:15,672 INFO L225 Difference]: With dead ends: 490 [2018-12-01 18:38:15,672 INFO L226 Difference]: Without dead ends: 433 [2018-12-01 18:38:15,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 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-12-01 18:38:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-12-01 18:38:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 424. [2018-12-01 18:38:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-01 18:38:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 458 transitions. [2018-12-01 18:38:15,692 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 458 transitions. Word has length 287 [2018-12-01 18:38:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:15,692 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 458 transitions. [2018-12-01 18:38:15,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-01 18:38:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 458 transitions. [2018-12-01 18:38:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-12-01 18:38:15,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:15,694 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:15,694 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:15,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:15,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1612760525, now seen corresponding path program 1 times [2018-12-01 18:38:15,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:15,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:15,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:15,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:15,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-01 18:38:16,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:38:16,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 18:38:16,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:16,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:38:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-01 18:38:16,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 18:38:16,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2018-12-01 18:38:16,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-01 18:38:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-01 18:38:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-12-01 18:38:16,978 INFO L87 Difference]: Start difference. First operand 424 states and 458 transitions. Second operand 27 states. [2018-12-01 18:38:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:17,236 INFO L93 Difference]: Finished difference Result 492 states and 541 transitions. [2018-12-01 18:38:17,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 18:38:17,236 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 290 [2018-12-01 18:38:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:17,237 INFO L225 Difference]: With dead ends: 492 [2018-12-01 18:38:17,237 INFO L226 Difference]: Without dead ends: 420 [2018-12-01 18:38:17,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-12-01 18:38:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-12-01 18:38:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 405. [2018-12-01 18:38:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-12-01 18:38:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 432 transitions. [2018-12-01 18:38:17,254 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 432 transitions. Word has length 290 [2018-12-01 18:38:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:17,254 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 432 transitions. [2018-12-01 18:38:17,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-01 18:38:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 432 transitions. [2018-12-01 18:38:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-12-01 18:38:17,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 18:38:17,255 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 18:38:17,255 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 18:38:17,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:38:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1586105132, now seen corresponding path program 1 times [2018-12-01 18:38:17,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:38:17,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:38:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:38:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-01 18:38:17,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 18:38:17,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 18:38:17,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:38:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:38:17,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:38:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-01 18:38:18,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 18:38:18,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2018-12-01 18:38:18,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-01 18:38:18,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-01 18:38:18,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-12-01 18:38:18,081 INFO L87 Difference]: Start difference. First operand 405 states and 432 transitions. Second operand 27 states. [2018-12-01 18:38:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:38:18,457 INFO L93 Difference]: Finished difference Result 422 states and 452 transitions. [2018-12-01 18:38:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 18:38:18,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 295 [2018-12-01 18:38:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 18:38:18,458 INFO L225 Difference]: With dead ends: 422 [2018-12-01 18:38:18,458 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 18:38:18,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-12-01 18:38:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 18:38:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 18:38:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 18:38:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 18:38:18,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2018-12-01 18:38:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 18:38:18,460 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:38:18,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-01 18:38:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 18:38:18,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 18:38:18,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 18:38:18,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:18,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:19,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:20,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:21,580 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-12-01 18:38:22,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:22,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:22,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:22,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:22,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:22,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:22,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:23,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:24,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:25,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:26,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:27,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 18:38:28,307 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 59 [2018-12-01 18:38:28,455 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-12-01 18:38:28,986 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2018-12-01 18:38:29,232 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2018-12-01 18:38:30,355 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2018-12-01 18:38:30,750 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 1 [2018-12-01 18:38:31,758 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2018-12-01 18:38:32,431 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2018-12-01 18:38:32,748 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 64 [2018-12-01 18:38:33,252 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 28 [2018-12-01 18:38:33,543 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 58 [2018-12-01 18:38:33,648 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2018-12-01 18:38:33,913 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2018-12-01 18:38:34,138 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2018-12-01 18:38:34,301 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2018-12-01 18:38:35,171 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2018-12-01 18:38:35,288 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2018-12-01 18:38:36,109 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 29 [2018-12-01 18:38:36,303 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2018-12-01 18:38:37,972 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 57 [2018-12-01 18:38:38,518 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-01 18:38:38,681 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-12-01 18:38:38,898 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 1 [2018-12-01 18:38:39,176 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2018-12-01 18:38:39,507 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2018-12-01 18:38:39,661 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2018-12-01 18:38:40,190 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 1 [2018-12-01 18:38:40,598 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2018-12-01 18:38:40,704 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-12-01 18:38:41,302 WARN L180 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2018-12-01 18:38:41,543 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2018-12-01 18:38:42,475 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2018-12-01 18:38:42,878 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 40 [2018-12-01 18:38:43,527 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2018-12-01 18:38:43,750 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2018-12-01 18:38:44,089 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 58 [2018-12-01 18:38:44,438 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 58 [2018-12-01 18:38:45,746 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-12-01 18:38:45,890 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2018-12-01 18:38:46,196 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-01 18:38:46,400 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-01 18:38:46,708 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-12-01 18:38:46,914 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2018-12-01 18:38:47,073 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2018-12-01 18:38:47,675 WARN L180 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2018-12-01 18:38:47,906 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2018-12-01 18:38:48,448 WARN L180 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2018-12-01 18:38:48,651 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-01 18:38:49,378 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2018-12-01 18:38:49,813 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2018-12-01 18:38:50,134 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2018-12-01 18:38:50,671 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2018-12-01 18:38:50,987 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 63 [2018-12-01 18:38:51,400 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 31 [2018-12-01 18:38:52,030 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 21272 21287) no Hoare annotation was computed. [2018-12-01 18:38:52,031 INFO L451 ceAbstractionStarter]: At program point IoGetConfigurationInformationENTRY(lines 21272 21287) the Hoare annotation is: true [2018-12-01 18:38:52,031 INFO L448 ceAbstractionStarter]: For program point L21280-1(line 21280) no Hoare annotation was computed. [2018-12-01 18:38:52,031 INFO L451 ceAbstractionStarter]: At program point L21280(line 21280) the Hoare annotation is: true [2018-12-01 18:38:52,031 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 21272 21287) no Hoare annotation was computed. [2018-12-01 18:38:52,031 INFO L448 ceAbstractionStarter]: For program point L20602-1(line 20602) no Hoare annotation was computed. [2018-12-01 18:38:52,031 INFO L448 ceAbstractionStarter]: For program point L20466(lines 20466 20470) no Hoare annotation was computed. [2018-12-01 18:38:52,031 INFO L444 ceAbstractionStarter]: At program point L20544(lines 20540 20592) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,031 INFO L448 ceAbstractionStarter]: For program point L20540(lines 20540 20592) no Hoare annotation was computed. [2018-12-01 18:38:52,032 INFO L444 ceAbstractionStarter]: At program point L20602(line 20602) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,032 INFO L448 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 20364 20630) no Hoare annotation was computed. [2018-12-01 18:38:52,032 INFO L444 ceAbstractionStarter]: At program point L20623(lines 20449 20624) the Hoare annotation is: (let ((.cse8 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (= |old(~compRegistered~0)| 0)) (.cse11 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse8 .cse9 .cse10 .cse11)) (.cse1 (= 0 ~pended~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse2 (= FloppyProcessQueuedRequests_~__cil_tmp17~25 0)) (.cse3 (= FloppyProcessQueuedRequests_~headOfList~0.offset 0)) (.cse5 (= 1 ~s~0)) (.cse6 (= FloppyProcessQueuedRequests_~headOfList~0.base 0)) (.cse7 (= ~PagingReferenceCount~0 1))) (and (or (= 0 ~myStatus~0) .cse0 (not (= |old(~myStatus~0)| 0)) (not (= |old(~customIrp~0)| 0))) (or (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7) .cse0) (or (not (= |old(~setEventCalled~0)| 1)) .cse8 .cse9 (= 1 ~setEventCalled~0) .cse10 .cse11) (or .cse8 (not .cse10) .cse9 (and .cse1 .cse4 .cse2 .cse3 .cse5 .cse6 .cse7) .cse11)))) [2018-12-01 18:38:52,032 INFO L448 ceAbstractionStarter]: For program point L20570-1(line 20570) no Hoare annotation was computed. [2018-12-01 18:38:52,032 INFO L444 ceAbstractionStarter]: At program point L20450-2(lines 20450 20622) the Hoare annotation is: (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse6 (= |old(~compRegistered~0)| 0)) (.cse8 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse5 .cse7 .cse6 .cse8)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= ~PagingReferenceCount~0 1))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (= 0 ~myStatus~0) (not (= |old(~customIrp~0)| 0))) (or .cse0 (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse2) .cse3 .cse4)) (or .cse5 (not .cse6) .cse7 (and .cse1 .cse2 .cse3 .cse4) .cse8) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse7 (= 1 ~setEventCalled~0) .cse6 .cse8)))) [2018-12-01 18:38:52,032 INFO L444 ceAbstractionStarter]: At program point L20570(line 20570) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,032 INFO L444 ceAbstractionStarter]: At program point L20550(lines 20549 20589) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,033 INFO L444 ceAbstractionStarter]: At program point L20517-1(lines 20450 20622) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,033 INFO L448 ceAbstractionStarter]: For program point L20517(lines 20517 20599) no Hoare annotation was computed. [2018-12-01 18:38:52,033 INFO L448 ceAbstractionStarter]: For program point L20546(lines 20546 20590) no Hoare annotation was computed. [2018-12-01 18:38:52,033 INFO L448 ceAbstractionStarter]: For program point L20451(line 20451) no Hoare annotation was computed. [2018-12-01 18:38:52,033 INFO L448 ceAbstractionStarter]: For program point L20459-1(line 20459) no Hoare annotation was computed. [2018-12-01 18:38:52,033 INFO L448 ceAbstractionStarter]: For program point $Ultimate##23(lines 20551 20588) no Hoare annotation was computed. [2018-12-01 18:38:52,033 INFO L444 ceAbstractionStarter]: At program point L20459(line 20459) the Hoare annotation is: (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse6 (= |old(~compRegistered~0)| 0)) (.cse8 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse5 .cse7 .cse6 .cse8)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= ~PagingReferenceCount~0 1))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (= 0 ~myStatus~0) (not (= |old(~customIrp~0)| 0))) (or .cse0 (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse2) .cse3 .cse4)) (or .cse5 (not .cse6) .cse7 (and .cse1 .cse2 .cse3 .cse4) .cse8) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse7 (= 1 ~setEventCalled~0) .cse6 .cse8)))) [2018-12-01 18:38:52,033 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 20551 20588) no Hoare annotation was computed. [2018-12-01 18:38:52,033 INFO L448 ceAbstractionStarter]: For program point L20600(lines 20600 20618) no Hoare annotation was computed. [2018-12-01 18:38:52,033 INFO L444 ceAbstractionStarter]: At program point L20534(line 20534) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,033 INFO L444 ceAbstractionStarter]: At program point L20608(line 20608) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,033 INFO L448 ceAbstractionStarter]: For program point L20608-1(line 20608) no Hoare annotation was computed. [2018-12-01 18:38:52,034 INFO L444 ceAbstractionStarter]: At program point L20584(line 20584) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,034 INFO L444 ceAbstractionStarter]: At program point FloppyProcessQueuedRequestsENTRY(lines 20364 20630) the Hoare annotation is: (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= |old(~compRegistered~0)| 0)) (.cse8 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse5 .cse6 .cse7 .cse8)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= ~PagingReferenceCount~0 1))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (= 0 ~myStatus~0) (not (= |old(~customIrp~0)| 0))) (or .cse0 (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse2) .cse3 .cse4)) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 .cse7 .cse8 (= 1 ~setEventCalled~0)) (or .cse5 (not .cse7) .cse6 (and .cse1 .cse2 .cse3 .cse4) .cse8)))) [2018-12-01 18:38:52,034 INFO L444 ceAbstractionStarter]: At program point L20547(lines 20546 20590) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,034 INFO L448 ceAbstractionStarter]: For program point L20543(lines 20543 20591) no Hoare annotation was computed. [2018-12-01 18:38:52,034 INFO L448 ceAbstractionStarter]: For program point L20605(lines 20605 20612) no Hoare annotation was computed. [2018-12-01 18:38:52,034 INFO L444 ceAbstractionStarter]: At program point L20605-2(lines 20605 20612) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,034 INFO L448 ceAbstractionStarter]: For program point L20490-1(line 20490) no Hoare annotation was computed. [2018-12-01 18:38:52,034 INFO L448 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 20364 20630) no Hoare annotation was computed. [2018-12-01 18:38:52,034 INFO L444 ceAbstractionStarter]: At program point L20560(line 20560) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,034 INFO L448 ceAbstractionStarter]: For program point L20494(lines 20494 20512) no Hoare annotation was computed. [2018-12-01 18:38:52,034 INFO L448 ceAbstractionStarter]: For program point L20560-1(line 20560) no Hoare annotation was computed. [2018-12-01 18:38:52,035 INFO L448 ceAbstractionStarter]: For program point L20494-2(lines 20494 20512) no Hoare annotation was computed. [2018-12-01 18:38:52,035 INFO L444 ceAbstractionStarter]: At program point L20490(line 20490) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,035 INFO L448 ceAbstractionStarter]: For program point L20523(lines 20523 20594) no Hoare annotation was computed. [2018-12-01 18:38:52,035 INFO L448 ceAbstractionStarter]: For program point L7699-1(line 7699) no Hoare annotation was computed. [2018-12-01 18:38:52,035 INFO L444 ceAbstractionStarter]: At program point L7699(line 7699) the Hoare annotation is: (let ((.cse1 (= 2 ~s~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse2 (= 0 ~pended~0)) (.cse5 (= ~s~0 4)) (.cse4 (= 1 ~setEventCalled~0)) (.cse3 (= 0 ~PagingReferenceCount~0))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1) (and (not (= 259 FloppyPnp_~ntStatus~3)) (and .cse2 .cse1 .cse3)) (and (= 6 ~s~0) (and .cse2 (not .cse0) .cse4 .cse3)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 (= ~pended~0 1) (= 0 ~customIrp~0) .cse5) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (or (and .cse2 .cse0 .cse5) (and (and .cse2 .cse5) .cse4 .cse3))))) [2018-12-01 18:38:52,035 INFO L448 ceAbstractionStarter]: For program point L7600-1(line 7600) no Hoare annotation was computed. [2018-12-01 18:38:52,035 INFO L444 ceAbstractionStarter]: At program point L7600(line 7600) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,035 INFO L444 ceAbstractionStarter]: At program point L6923-1(lines 6923 6930) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,035 INFO L448 ceAbstractionStarter]: For program point L6923(lines 6923 6930) no Hoare annotation was computed. [2018-12-01 18:38:52,036 INFO L444 ceAbstractionStarter]: At program point L6989(lines 6985 7687) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,036 INFO L444 ceAbstractionStarter]: At program point L7204loopEntry(lines 7204 7207) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,036 INFO L448 ceAbstractionStarter]: For program point L7105-1(lines 7105 7106) no Hoare annotation was computed. [2018-12-01 18:38:52,036 INFO L444 ceAbstractionStarter]: At program point L7105(lines 7105 7106) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (<= FloppyPnp_~ntStatus~3 259)) (.cse4 (<= 259 FloppyPnp_~ntStatus~3))) (or (and (= 0 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) .cse3 .cse4))) [2018-12-01 18:38:52,036 INFO L448 ceAbstractionStarter]: For program point L7485-1(line 7485) no Hoare annotation was computed. [2018-12-01 18:38:52,036 INFO L444 ceAbstractionStarter]: At program point L7485(line 7485) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,036 INFO L444 ceAbstractionStarter]: At program point L7502(line 7502) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,036 INFO L444 ceAbstractionStarter]: At program point L7023loopEntry(lines 7023 7026) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,036 INFO L448 ceAbstractionStarter]: For program point L7502-1(lines 6999 7680) no Hoare annotation was computed. [2018-12-01 18:38:52,037 INFO L448 ceAbstractionStarter]: For program point L7139(lines 7139 7145) no Hoare annotation was computed. [2018-12-01 18:38:52,037 INFO L448 ceAbstractionStarter]: For program point L7073-1(line 7073) no Hoare annotation was computed. [2018-12-01 18:38:52,037 INFO L444 ceAbstractionStarter]: At program point L7073(line 7073) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,037 INFO L444 ceAbstractionStarter]: At program point L7123(line 7123) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= 1 ~s~0)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (<= FloppyPnp_~ntStatus~3 259)) (.cse4 (<= 259 FloppyPnp_~ntStatus~3))) (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) .cse3 .cse4) (and (= 0 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-12-01 18:38:52,037 INFO L444 ceAbstractionStarter]: At program point L7470(line 7470) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,037 INFO L448 ceAbstractionStarter]: For program point L6991(lines 6991 7685) no Hoare annotation was computed. [2018-12-01 18:38:52,037 INFO L448 ceAbstractionStarter]: For program point L7470-1(line 7470) no Hoare annotation was computed. [2018-12-01 18:38:52,037 INFO L448 ceAbstractionStarter]: For program point L7041-1(lines 7037 7043) no Hoare annotation was computed. [2018-12-01 18:38:52,037 INFO L444 ceAbstractionStarter]: At program point L7041(line 7041) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,037 INFO L444 ceAbstractionStarter]: At program point L7190(line 7190) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (not (= FloppyPnp_~ntStatus~3 259))) (.cse2 (= 1 ~s~0))) (or (and .cse0 .cse1 .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) .cse0 .cse1 .cse2))) [2018-12-01 18:38:52,038 INFO L444 ceAbstractionStarter]: At program point L6926(line 6926) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,038 INFO L444 ceAbstractionStarter]: At program point L7438(line 7438) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,038 INFO L444 ceAbstractionStarter]: At program point L6992(lines 6991 7685) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,038 INFO L448 ceAbstractionStarter]: For program point L7438-1(lines 7434 7440) no Hoare annotation was computed. [2018-12-01 18:38:52,038 INFO L448 ceAbstractionStarter]: For program point L7587-1(line 7587) no Hoare annotation was computed. [2018-12-01 18:38:52,038 INFO L444 ceAbstractionStarter]: At program point L7587(line 7587) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,038 INFO L448 ceAbstractionStarter]: For program point L6976(lines 6976 7690) no Hoare annotation was computed. [2018-12-01 18:38:52,038 INFO L444 ceAbstractionStarter]: At program point L7092-1(line 7092) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,038 INFO L444 ceAbstractionStarter]: At program point L7571(line 7571) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,038 INFO L448 ceAbstractionStarter]: For program point L7604-1(line 7604) no Hoare annotation was computed. [2018-12-01 18:38:52,039 INFO L444 ceAbstractionStarter]: At program point L7092(line 7092) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,039 INFO L444 ceAbstractionStarter]: At program point L7604(line 7604) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,039 INFO L448 ceAbstractionStarter]: For program point L7307-1(lines 7269 7414) no Hoare annotation was computed. [2018-12-01 18:38:52,039 INFO L444 ceAbstractionStarter]: At program point L7307(line 7307) the Hoare annotation is: (or (let ((.cse0 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse0) 112)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse0 0)) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,039 INFO L448 ceAbstractionStarter]: For program point L7373-1(line 7373) no Hoare annotation was computed. [2018-12-01 18:38:52,039 INFO L444 ceAbstractionStarter]: At program point L7373(line 7373) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (let ((.cse0 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~customIrp~0) (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse0) 112)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse0 0)) (= 0 ~myStatus~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)))) [2018-12-01 18:38:52,039 INFO L448 ceAbstractionStarter]: For program point L7175-1(line 7175) no Hoare annotation was computed. [2018-12-01 18:38:52,039 INFO L444 ceAbstractionStarter]: At program point L7175(line 7175) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= 3 ~s~0)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (<= FloppyPnp_~ntStatus~3 259)) (.cse4 (<= 259 FloppyPnp_~ntStatus~3))) (or (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) .cse3 .cse4) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-12-01 18:38:52,040 INFO L444 ceAbstractionStarter]: At program point L7621-1(line 7621) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,040 INFO L444 ceAbstractionStarter]: At program point L7621(line 7621) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,040 INFO L444 ceAbstractionStarter]: At program point L7423(lines 7418 7424) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,040 INFO L444 ceAbstractionStarter]: At program point L6977(lines 6976 7690) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,040 INFO L448 ceAbstractionStarter]: For program point L7225(lines 7225 7414) no Hoare annotation was computed. [2018-12-01 18:38:52,040 INFO L448 ceAbstractionStarter]: For program point L6994(lines 6994 7684) no Hoare annotation was computed. [2018-12-01 18:38:52,040 INFO L444 ceAbstractionStarter]: At program point L7027(lines 7013 7029) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,040 INFO L448 ceAbstractionStarter]: For program point L7093(line 7093) no Hoare annotation was computed. [2018-12-01 18:38:52,040 INFO L448 ceAbstractionStarter]: For program point L7143-1(lines 7139 7145) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L444 ceAbstractionStarter]: At program point L7622(line 7622) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,041 INFO L444 ceAbstractionStarter]: At program point L7143(line 7143) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point L7556-1(lines 7556 7575) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point L7556(lines 7556 7575) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 6487 7709) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point L7705(line 7705) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L444 ceAbstractionStarter]: At program point L6995(lines 6994 7684) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point L7375(lines 7375 7387) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point L7375-2(lines 7375 7387) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point L7623(line 7623) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point L6979(lines 6979 7689) no Hoare annotation was computed. [2018-12-01 18:38:52,041 INFO L448 ceAbstractionStarter]: For program point L7392-1(line 7392) no Hoare annotation was computed. [2018-12-01 18:38:52,042 INFO L444 ceAbstractionStarter]: At program point L7392(line 7392) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~myStatus~0) (let ((.cse4 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse4 0)) .cse0 .cse1 .cse2 .cse3 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse4) 112)))) (= 0 ~customIrp~0)))) [2018-12-01 18:38:52,042 INFO L444 ceAbstractionStarter]: At program point L6913loopEntry(lines 6913 6916) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0))) [2018-12-01 18:38:52,042 INFO L448 ceAbstractionStarter]: For program point L7095(lines 7095 7192) no Hoare annotation was computed. [2018-12-01 18:38:52,042 INFO L444 ceAbstractionStarter]: At program point L7640(lines 6999 7680) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,042 INFO L448 ceAbstractionStarter]: For program point L6963-1(line 6963) no Hoare annotation was computed. [2018-12-01 18:38:52,042 INFO L444 ceAbstractionStarter]: At program point L6963(line 6963) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,042 INFO L448 ceAbstractionStarter]: For program point L7508-1(lines 7504 7510) no Hoare annotation was computed. [2018-12-01 18:38:52,042 INFO L444 ceAbstractionStarter]: At program point L7508(line 7508) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,042 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 6487 7709) no Hoare annotation was computed. [2018-12-01 18:38:52,042 INFO L448 ceAbstractionStarter]: For program point L7013(lines 7013 7029) no Hoare annotation was computed. [2018-12-01 18:38:52,043 INFO L444 ceAbstractionStarter]: At program point L7311(line 7311) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,043 INFO L444 ceAbstractionStarter]: At program point L7212loopEntry(lines 7212 7215) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,043 INFO L448 ceAbstractionStarter]: For program point L7493-1(line 7493) no Hoare annotation was computed. [2018-12-01 18:38:52,043 INFO L444 ceAbstractionStarter]: At program point L7493(line 7493) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,043 INFO L444 ceAbstractionStarter]: At program point L6998(lines 6997 7683) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,043 INFO L448 ceAbstractionStarter]: For program point L6932(line 6932) no Hoare annotation was computed. [2018-12-01 18:38:52,043 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 6999 7682) no Hoare annotation was computed. [2018-12-01 18:38:52,043 INFO L448 ceAbstractionStarter]: For program point L6982(lines 6982 7688) no Hoare annotation was computed. [2018-12-01 18:38:52,043 INFO L444 ceAbstractionStarter]: At program point L7015loopEntry(lines 7015 7018) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,043 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 6999 7682) no Hoare annotation was computed. [2018-12-01 18:38:52,044 INFO L444 ceAbstractionStarter]: At program point L7610(line 7610) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,044 INFO L444 ceAbstractionStarter]: At program point L7412(line 7412) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~myStatus~0) (let ((.cse4 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse4 0)) .cse0 .cse1 .cse2 .cse3 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse4) 112)))) (= 0 ~customIrp~0)))) [2018-12-01 18:38:52,044 INFO L448 ceAbstractionStarter]: For program point L7693(line 7693) no Hoare annotation was computed. [2018-12-01 18:38:52,044 INFO L444 ceAbstractionStarter]: At program point L6983(lines 6979 7689) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,044 INFO L448 ceAbstractionStarter]: For program point L7561-1(line 7561) no Hoare annotation was computed. [2018-12-01 18:38:52,044 INFO L444 ceAbstractionStarter]: At program point L7561(line 7561) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,044 INFO L444 ceAbstractionStarter]: At program point L6917(lines 6912 6918) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0))) [2018-12-01 18:38:52,044 INFO L448 ceAbstractionStarter]: For program point L7231(lines 7231 7237) no Hoare annotation was computed. [2018-12-01 18:38:52,044 INFO L444 ceAbstractionStarter]: At program point L7479(lines 7474 7480) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7545-1(line 7545) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L444 ceAbstractionStarter]: At program point L7545(line 7545) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7314(lines 7314 7321) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7314-1(lines 7309 7322) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7595-1(lines 7595 7614) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7116-1(lines 7116 7127) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7595(lines 7595 7614) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7116(lines 7116 7127) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L6951(lines 6951 6968) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L444 ceAbstractionStarter]: At program point L7678(line 7678) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7678-1(line 7678) no Hoare annotation was computed. [2018-12-01 18:38:52,045 INFO L448 ceAbstractionStarter]: For program point L7381-1(lines 7381 7382) no Hoare annotation was computed. [2018-12-01 18:38:52,046 INFO L444 ceAbstractionStarter]: At program point L7381(lines 7381 7382) the Hoare annotation is: (let ((.cse10 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~customIrp~0)) (.cse2 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse10) 112))) (.cse3 (or (and (<= 0 (+ FloppyPnp_~__cil_tmp164~2 2147483648)) (<= (+ FloppyPnp_~__cil_tmp164~2 1) 0)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse10 0)))) (.cse4 (= 0 ~myStatus~0)) (.cse5 (not (= 0 ~compRegistered~0))) (.cse6 (= 1 ~setEventCalled~0)) (.cse7 (= ~PagingReferenceCount~0 1)) (.cse8 (<= FloppyPnp_~ntStatus~3 259)) (.cse9 (<= 259 FloppyPnp_~ntStatus~3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~s~0) .cse6 .cse7 .cse8 .cse9) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-01 18:38:52,046 INFO L444 ceAbstractionStarter]: At program point L7216(lines 7202 7218) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,046 INFO L448 ceAbstractionStarter]: For program point L7084-1(line 7084) no Hoare annotation was computed. [2018-12-01 18:38:52,046 INFO L444 ceAbstractionStarter]: At program point L7084(line 7084) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,046 INFO L448 ceAbstractionStarter]: For program point L6985(lines 6985 7687) no Hoare annotation was computed. [2018-12-01 18:38:52,046 INFO L444 ceAbstractionStarter]: At program point L7646(line 7646) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,046 INFO L448 ceAbstractionStarter]: For program point L7002(line 7002) no Hoare annotation was computed. [2018-12-01 18:38:52,046 INFO L448 ceAbstractionStarter]: For program point L7646-1(lines 7642 7648) no Hoare annotation was computed. [2018-12-01 18:38:52,046 INFO L444 ceAbstractionStarter]: At program point L7316(line 7316) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,047 INFO L444 ceAbstractionStarter]: At program point L7696-2(lines 7696 7703) the Hoare annotation is: (let ((.cse1 (= 2 ~s~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse2 (= 0 ~pended~0)) (.cse5 (= ~s~0 4)) (.cse4 (= 1 ~setEventCalled~0)) (.cse3 (= 0 ~PagingReferenceCount~0))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1) (and (not (= 259 FloppyPnp_~ntStatus~3)) (and .cse2 .cse1 .cse3)) (and (= 6 ~s~0) (and .cse2 (not .cse0) .cse4 .cse3)) (and .cse0 (= ~pended~0 1) (= 0 ~customIrp~0) .cse5) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (or (and .cse2 .cse0 .cse5) (and (and .cse2 .cse5) .cse4 .cse3))))) [2018-12-01 18:38:52,047 INFO L448 ceAbstractionStarter]: For program point L7696(lines 7696 7703) no Hoare annotation was computed. [2018-12-01 18:38:52,047 INFO L448 ceAbstractionStarter]: For program point L6920(line 6920) no Hoare annotation was computed. [2018-12-01 18:38:52,047 INFO L448 ceAbstractionStarter]: For program point L7267-1(line 7267) no Hoare annotation was computed. [2018-12-01 18:38:52,047 INFO L444 ceAbstractionStarter]: At program point L7267(line 7267) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,047 INFO L444 ceAbstractionStarter]: At program point L7300-1(line 7300) the Hoare annotation is: (or (let ((.cse0 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse0) 112)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse0 0)) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,047 INFO L444 ceAbstractionStarter]: At program point L7300(line 7300) the Hoare annotation is: (or (let ((.cse0 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse0) 112)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse0 0)) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,047 INFO L448 ceAbstractionStarter]: For program point L7036(lines 7036 7078) no Hoare annotation was computed. [2018-12-01 18:38:52,047 INFO L448 ceAbstractionStarter]: For program point L7581-1(line 7581) no Hoare annotation was computed. [2018-12-01 18:38:52,048 INFO L444 ceAbstractionStarter]: At program point L7581(line 7581) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,048 INFO L448 ceAbstractionStarter]: For program point L7565-1(line 7565) no Hoare annotation was computed. [2018-12-01 18:38:52,048 INFO L444 ceAbstractionStarter]: At program point L7565(line 7565) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-01 18:38:52,048 INFO L444 ceAbstractionStarter]: At program point L7400-1(line 7400) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~myStatus~0) (let ((.cse4 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse4 0)) .cse0 .cse1 .cse2 .cse3 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse4) 112)))) (= 0 ~customIrp~0)))) [2018-12-01 18:38:52,048 INFO L444 ceAbstractionStarter]: At program point L7400(line 7400) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~myStatus~0) (let ((.cse4 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse4 0)) .cse0 .cse1 .cse2 .cse3 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse4) 112)))) (= 0 ~customIrp~0)))) [2018-12-01 18:38:52,048 INFO L448 ceAbstractionStarter]: For program point L7202(lines 7202 7218) no Hoare annotation was computed. [2018-12-01 18:38:52,048 INFO L448 ceAbstractionStarter]: For program point L7235-1(lines 7231 7237) no Hoare annotation was computed. [2018-12-01 18:38:52,048 INFO L444 ceAbstractionStarter]: At program point L7235(line 7235) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,048 INFO L448 ceAbstractionStarter]: For program point L7301(line 7301) no Hoare annotation was computed. [2018-12-01 18:38:52,049 INFO L444 ceAbstractionStarter]: At program point L7681(lines 6999 7682) the Hoare annotation is: (let ((.cse2 (= ~PagingReferenceCount~0 1)) (.cse0 (= 0 ~pended~0)) (.cse8 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (.cse4 (= 0 ~customIrp~0)) (.cse6 (= ~s~0 4)) (.cse3 (= 0 ~compRegistered~0)) (.cse7 (not (= FloppyPnp_~ntStatus~3 259))) (.cse1 (= 2 ~s~0)) (.cse5 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)))) (or (and (and .cse0 .cse1 .cse2) (not (= 259 FloppyPnp_~ntStatus~3))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse3 (= ~pended~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse1) (and .cse0 (= 6 ~s~0) (not .cse3) (= 1 ~setEventCalled~0) .cse2) (and .cse0 .cse3 .cse8 .cse2 .cse6) (and .cse0 .cse3 .cse8 .cse4 .cse6) (and .cse3 .cse7 .cse1 .cse5))) [2018-12-01 18:38:52,049 INFO L448 ceAbstractionStarter]: For program point L7037(lines 7037 7043) no Hoare annotation was computed. [2018-12-01 18:38:52,049 INFO L448 ceAbstractionStarter]: For program point L7434(lines 7434 7440) no Hoare annotation was computed. [2018-12-01 18:38:52,049 INFO L448 ceAbstractionStarter]: For program point L6988(lines 6988 7686) no Hoare annotation was computed. [2018-12-01 18:38:52,049 INFO L448 ceAbstractionStarter]: For program point L7401(line 7401) no Hoare annotation was computed. [2018-12-01 18:38:52,049 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 6487 7709) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0))) [2018-12-01 18:38:52,049 INFO L444 ceAbstractionStarter]: At program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: (let ((.cse5 (= 0 ~pended~0)) (.cse6 (= 0 ~compRegistered~0)) (.cse7 (= 1 ~s~0)) (.cse2 (not (= |old(~compRegistered~0)| 0))) (.cse3 (not (= 0 |old(~pended~0)|))) (.cse4 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse2 .cse3 (not (= |old(~PagingReferenceCount~0)| 0)) .cse4)) (.cse1 (and .cse5 .cse6 .cse7))) (and (or (or .cse0 (not (= |old(~customIrp~0)| 0))) (= 0 ~customIrp~0)) (or .cse1 .cse2 .cse3 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse4) (or .cse0 (and .cse5 .cse6 .cse7 (= 0 ~PagingReferenceCount~0))) (or .cse1 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse2 .cse3 .cse4)))) [2018-12-01 18:38:52,049 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,049 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,050 INFO L444 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: (let ((.cse1 (not (= |old(~compRegistered~0)| 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) (and (or .cse0 (not (= |old(~customIrp~0)| 0))) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse1 .cse2 .cse3) (or .cse1 .cse2 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse3) (or .cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (or (not (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (not (= |#funAddr~FloppyPnp.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|))) (= 1 ~s~0)))))) [2018-12-01 18:38:52,050 INFO L448 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,050 INFO L448 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,050 INFO L444 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (let ((.cse1 (not (= |old(~compRegistered~0)| 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) (and (or (= 0 ~customIrp~0) (or .cse0 (not (= |old(~customIrp~0)| 0)))) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse1 .cse2 .cse3) (or .cse1 .cse2 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse3) (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|) (= 0 ~PagingReferenceCount~0)) .cse0)))) [2018-12-01 18:38:52,050 INFO L448 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,050 INFO L448 ceAbstractionStarter]: For program point L-1-8(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,050 INFO L444 ceAbstractionStarter]: At program point L-1-9(line -1) the Hoare annotation is: (let ((.cse2 (not (= |old(~compRegistered~0)| 0))) (.cse3 (not (= 0 |old(~pended~0)|))) (.cse4 (not (= 1 |old(~s~0)|)))) (let ((.cse1 (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (.cse0 (or .cse2 .cse3 (not (= |old(~PagingReferenceCount~0)| 0)) .cse4))) (and (or .cse0 .cse1) (or .cse2 .cse3 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not .cse1) .cse4) (or .cse0 (not (= |old(~customIrp~0)| 0))) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse2 .cse3 .cse4)))) [2018-12-01 18:38:52,050 INFO L448 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,050 INFO L448 ceAbstractionStarter]: For program point L-1-12(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,050 INFO L444 ceAbstractionStarter]: At program point L-1-13(line -1) the Hoare annotation is: (let ((.cse1 (not (= |old(~compRegistered~0)| 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) (and (or .cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (or (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|))) (or (not (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (not (= |#funAddr~FloppyPnp.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|))) (= 1 ~s~0))) (or .cse0 (not (= |old(~customIrp~0)| 0))) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse1 .cse2 .cse3) (or .cse1 .cse2 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse3)))) [2018-12-01 18:38:52,051 INFO L448 ceAbstractionStarter]: For program point L-1-14(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,051 INFO L444 ceAbstractionStarter]: At program point L-1-16(line -1) the Hoare annotation is: (let ((.cse5 (not (= |old(~compRegistered~0)| 0))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (not (= 1 |old(~s~0)|)))) (let ((.cse1 (or .cse5 .cse6 (not (= |old(~PagingReferenceCount~0)| 0)) .cse7)) (.cse0 (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= 1 ~s~0))) (and (or .cse0 (or .cse1 (not (= |old(~customIrp~0)| 0)))) (or .cse1 (and .cse2 .cse3 (or (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|))) (or (not .cse0) (not (= |#funAddr~FloppyPnp.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|))) .cse4)) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (and .cse2 .cse3 .cse4) .cse5 .cse6 .cse7) (or (and .cse2 .cse3 .cse4 (not (= |#funAddr~FloppyDeviceControl.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|))) .cse5 .cse6 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse7)))) [2018-12-01 18:38:52,051 INFO L448 ceAbstractionStarter]: For program point L-1-17(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,051 INFO L448 ceAbstractionStarter]: For program point L-1-18(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,051 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,051 INFO L444 ceAbstractionStarter]: At program point L20821(line 20821) the Hoare annotation is: (let ((.cse0 (= 2 ~s~0)) (.cse2 (not (= 259 main_~status~4))) (.cse5 (= 0 ~compRegistered~0)) (.cse3 (= main_~status~4 ~lowerDriverReturn~0)) (.cse4 (= 0 ~pended~0)) (.cse1 (= main_~__cil_tmp14~23 1)) (.cse7 (= 1 ~setEventCalled~0)) (.cse6 (= ~s~0 4)) (.cse8 (= 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse3 (and .cse4 .cse5) .cse6) (and .cse5 .cse0 .cse2) (and .cse1 (= ~pended~0 1) (= 0 ~customIrp~0) (and .cse5 .cse6)) (and .cse4 (not .cse5) (= 6 ~s~0) .cse1 .cse7 .cse8) (not (= |old(~compRegistered~0)| 0)) (= 1 ~s~0) (not (= 0 |old(~pended~0)|)) (and .cse3 (and .cse4 .cse1 .cse7 .cse6 .cse8)) (not (= |old(~customIrp~0)| 0)))) [2018-12-01 18:38:52,051 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20692 20905) no Hoare annotation was computed. [2018-12-01 18:38:52,051 INFO L444 ceAbstractionStarter]: At program point L20862(lines 20851 20891) the Hoare annotation is: (let ((.cse6 (= 0 ~compRegistered~0)) (.cse2 (not (= 259 main_~status~4))) (.cse5 (= 0 ~pended~0)) (.cse1 (= main_~__cil_tmp14~23 1)) (.cse7 (= ~s~0 4))) (let ((.cse4 (= main_~status~4 ~lowerDriverReturn~0)) (.cse3 (let ((.cse8 (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0)) (.cse9 (= 1 ~setEventCalled~0)) (.cse10 (= 0 ~PagingReferenceCount~0))) (or (and .cse6 .cse1 .cse7 (or (<= 2 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0))) (and .cse5 (not (= 6 ~s~0)) (not .cse6) .cse1 .cse8 .cse9 .cse2 .cse10) (and .cse5 .cse1 .cse8 .cse9 .cse7 .cse10)))) (.cse0 (= 2 ~s~0))) (or (and .cse0 .cse1 .cse2) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse3 (= ~pended~0 1) (= 0 ~customIrp~0)) (and .cse4 (and .cse5 .cse6) .cse7) (and .cse4 .cse3) (and .cse6 .cse0 .cse2) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-12-01 18:38:52,052 INFO L444 ceAbstractionStarter]: At program point L20763(lines 20762 20816) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,052 INFO L448 ceAbstractionStarter]: For program point L20838(lines 20838 20842) no Hoare annotation was computed. [2018-12-01 18:38:52,052 INFO L448 ceAbstractionStarter]: For program point L20871(lines 20871 20877) no Hoare annotation was computed. [2018-12-01 18:38:52,052 INFO L444 ceAbstractionStarter]: At program point L20772(lines 20771 20813) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= main_~__cil_tmp14~23 1) (< 0 (+ main_~status~4 1)) (= 0 ~PagingReferenceCount~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,052 INFO L448 ceAbstractionStarter]: For program point L20739(lines 20739 20747) no Hoare annotation was computed. [2018-12-01 18:38:52,052 INFO L444 ceAbstractionStarter]: At program point L20780(line 20780) the Hoare annotation is: (or (and (= |#funAddr~FloppyCreateClose.offset| main_~__cil_tmp15~25.offset) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,052 INFO L448 ceAbstractionStarter]: For program point L20780-1(line 20780) no Hoare annotation was computed. [2018-12-01 18:38:52,052 INFO L444 ceAbstractionStarter]: At program point L20739-2(lines 20739 20747) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= 1 ~s~0) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0))) [2018-12-01 18:38:52,052 INFO L448 ceAbstractionStarter]: For program point L20830(lines 20830 20834) no Hoare annotation was computed. [2018-12-01 18:38:52,052 INFO L448 ceAbstractionStarter]: For program point L20847-1(lines 20829 20901) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point L20847(lines 20847 20898) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L444 ceAbstractionStarter]: At program point L20724(line 20724) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 main_~status~4) (= 0 ~customIrp~0) (= 0 ~s~0) (= 0 ~myStatus~0) (= 0 ~PagingReferenceCount~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point L20724-1(line 20724) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point L20864(lines 20864 20868) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L444 ceAbstractionStarter]: At program point L20798(line 20798) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= main_~__cil_tmp14~23 1) (= 0 ~customIrp~0) (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~26.base) (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~26.offset) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0))) [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point L20765(lines 20765 20815) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point L20798-1(line 20798) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 20776 20811) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L444 ceAbstractionStarter]: At program point L20873(line 20873) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20692 20905) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 20776 20811) no Hoare annotation was computed. [2018-12-01 18:38:52,053 INFO L448 ceAbstractionStarter]: For program point L20881(lines 20881 20887) no Hoare annotation was computed. [2018-12-01 18:38:52,054 INFO L448 ceAbstractionStarter]: For program point L20749(line 20749) no Hoare annotation was computed. [2018-12-01 18:38:52,054 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 20692 20905) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,054 INFO L444 ceAbstractionStarter]: At program point L20766(lines 20765 20815) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= main_~__cil_tmp14~23 1) (< 0 (+ main_~status~4 1))) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,054 INFO L451 ceAbstractionStarter]: At program point L20775(lines 20774 20812) the Hoare annotation is: true [2018-12-01 18:38:52,054 INFO L444 ceAbstractionStarter]: At program point L20792(line 20792) the Hoare annotation is: (or (and (= |#funAddr~FloppyDeviceControl.offset| main_~__cil_tmp17~26.offset) (= |#funAddr~FloppyDeviceControl.base| main_~__cil_tmp17~26.base) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= main_~__cil_tmp14~23 1) (< 0 (+ main_~status~4 1))) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,054 INFO L448 ceAbstractionStarter]: For program point L20726(lines 20726 20828) no Hoare annotation was computed. [2018-12-01 18:38:52,054 INFO L448 ceAbstractionStarter]: For program point L20759(lines 20759 20817) no Hoare annotation was computed. [2018-12-01 18:38:52,055 INFO L448 ceAbstractionStarter]: For program point L20792-1(line 20792) no Hoare annotation was computed. [2018-12-01 18:38:52,055 INFO L448 ceAbstractionStarter]: For program point L20726-1(lines 20719 20904) no Hoare annotation was computed. [2018-12-01 18:38:52,055 INFO L448 ceAbstractionStarter]: For program point L20850(lines 20850 20894) no Hoare annotation was computed. [2018-12-01 18:38:52,055 INFO L444 ceAbstractionStarter]: At program point L20883(line 20883) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,055 INFO L444 ceAbstractionStarter]: At program point L20760(lines 20759 20817) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,055 INFO L448 ceAbstractionStarter]: For program point L20851(lines 20851 20891) no Hoare annotation was computed. [2018-12-01 18:38:52,055 INFO L448 ceAbstractionStarter]: For program point L20768(lines 20768 20814) no Hoare annotation was computed. [2018-12-01 18:38:52,055 INFO L444 ceAbstractionStarter]: At program point L20810(lines 20726 20826) the Hoare annotation is: (let ((.cse0 (= 2 ~s~0)) (.cse2 (not (= 259 main_~status~4))) (.cse5 (= 0 ~compRegistered~0)) (.cse3 (= main_~status~4 ~lowerDriverReturn~0)) (.cse4 (= 0 ~pended~0)) (.cse1 (= main_~__cil_tmp14~23 1)) (.cse7 (= 1 ~setEventCalled~0)) (.cse6 (= ~s~0 4)) (.cse8 (= 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse3 (and .cse4 .cse5) .cse6) (and .cse5 .cse0 .cse2) (and .cse1 (= ~pended~0 1) (= 0 ~customIrp~0) (and .cse5 .cse6)) (and .cse4 (not .cse5) (= 6 ~s~0) .cse1 .cse7 .cse8) (not (= |old(~compRegistered~0)| 0)) (= 1 ~s~0) (not (= 0 |old(~pended~0)|)) (and .cse3 (and .cse4 .cse1 .cse7 .cse6 .cse8)) (not (= |old(~customIrp~0)| 0)))) [2018-12-01 18:38:52,055 INFO L448 ceAbstractionStarter]: For program point L20852(lines 20852 20860) no Hoare annotation was computed. [2018-12-01 18:38:52,055 INFO L444 ceAbstractionStarter]: At program point L20786(line 20786) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= |#funAddr~FloppyCreateClose.offset| main_~__cil_tmp16~26.offset)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,062 INFO L444 ceAbstractionStarter]: At program point L20769(lines 20768 20814) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= main_~__cil_tmp14~23 1) (= 0 ~customIrp~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,063 INFO L444 ceAbstractionStarter]: At program point L20836(lines 20829 20901) the Hoare annotation is: (let ((.cse0 (= 2 ~s~0)) (.cse2 (not (= 259 main_~status~4))) (.cse4 (= 0 ~compRegistered~0)) (.cse7 (= main_~status~4 ~lowerDriverReturn~0)) (.cse3 (= 0 ~pended~0)) (.cse1 (= main_~__cil_tmp14~23 1)) (.cse5 (= 1 ~setEventCalled~0)) (.cse8 (= ~s~0 4)) (.cse6 (= 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= 6 ~s~0) (not .cse4) .cse1 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse7 (and .cse3 .cse4) .cse8) (and .cse4 .cse0 .cse2) (and .cse1 (= ~pended~0 1) (= 0 ~customIrp~0) (and .cse4 .cse8)) (= 0 ~s~0) (not (= |old(~compRegistered~0)| 0)) (= 1 ~s~0) (not (= 0 |old(~pended~0)|)) (and .cse7 (and .cse3 .cse1 .cse5 .cse8 .cse6)) (not (= |old(~customIrp~0)| 0)))) [2018-12-01 18:38:52,063 INFO L448 ceAbstractionStarter]: For program point L20753(lines 20753 20757) no Hoare annotation was computed. [2018-12-01 18:38:52,063 INFO L448 ceAbstractionStarter]: For program point L20786-1(line 20786) no Hoare annotation was computed. [2018-12-01 18:38:52,063 INFO L444 ceAbstractionStarter]: At program point L20844(lines 20837 20900) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0)) (.cse3 (= 0 ~pended~0)) (.cse1 (= main_~__cil_tmp14~23 1)) (.cse5 (= 1 ~setEventCalled~0)) (.cse9 (= ~s~0 4)) (.cse6 (= 0 ~PagingReferenceCount~0))) (let ((.cse7 (or (and .cse4 .cse1 .cse9 (or (<= 2 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0))) (and .cse3 .cse1 (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0) .cse5 .cse9 .cse6))) (.cse8 (= main_~status~4 ~lowerDriverReturn~0)) (.cse0 (= 2 ~s~0)) (.cse2 (not (= 259 main_~status~4)))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= 6 ~s~0) (not .cse4) .cse1 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (and .cse7 (= ~pended~0 1) (= 0 ~customIrp~0)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse8 .cse7) (and .cse8 (and .cse3 .cse4) .cse9) (and .cse4 .cse0 .cse2) (= 0 ~s~0) (not (= |old(~compRegistered~0)| 0)) (= 1 ~s~0) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-12-01 18:38:52,063 INFO L448 ceAbstractionStarter]: For program point L20853(lines 20853 20857) no Hoare annotation was computed. [2018-12-01 18:38:52,063 INFO L448 ceAbstractionStarter]: For program point L20762(lines 20762 20816) no Hoare annotation was computed. [2018-12-01 18:38:52,063 INFO L448 ceAbstractionStarter]: For program point L20870(lines 20870 20889) no Hoare annotation was computed. [2018-12-01 18:38:52,063 INFO L444 ceAbstractionStarter]: At program point L20804(line 20804) the Hoare annotation is: (or (and (= |#funAddr~FloppyPower.base| main_~__cil_tmp19~28.base) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= main_~__cil_tmp14~23 1) (< 0 (+ main_~status~4 1)) (= 0 ~PagingReferenceCount~0) (= |#funAddr~FloppyPower.offset| main_~__cil_tmp19~28.offset)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-01 18:38:52,069 INFO L448 ceAbstractionStarter]: For program point L20771(lines 20771 20813) no Hoare annotation was computed. [2018-12-01 18:38:52,069 INFO L448 ceAbstractionStarter]: For program point L20804-1(line 20804) no Hoare annotation was computed. [2018-12-01 18:38:52,069 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedInsertTailListENTRY(lines 20974 20985) the Hoare annotation is: true [2018-12-01 18:38:52,069 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 20974 20985) no Hoare annotation was computed. [2018-12-01 18:38:52,069 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 20974 20985) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L444 ceAbstractionStarter]: At program point L21415(line 21415) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point L21415-1(lines 21407 21420) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 21407 21420) the Hoare annotation is: (or (or (not (= ~setEventCalled~0 1)) (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (= ~s~0 |old(~s~0)|)) [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 21407 21420) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point RtlInitUnicodeStringFINAL(lines 21990 21997) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L451 ceAbstractionStarter]: At program point RtlInitUnicodeStringENTRY(lines 21990 21997) the Hoare annotation is: true [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point RtlInitUnicodeStringEXIT(lines 21990 21997) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L451 ceAbstractionStarter]: At program point PoStartNextPowerIrpENTRY(lines 21840 21846) the Hoare annotation is: true [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point PoStartNextPowerIrpFINAL(lines 21840 21846) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point PoStartNextPowerIrpEXIT(lines 21840 21846) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L451 ceAbstractionStarter]: At program point L21864(lines 21863 21873) the Hoare annotation is: true [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 21854 21876) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L451 ceAbstractionStarter]: At program point L21861(lines 21860 21874) the Hoare annotation is: true [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point L21860(lines 21860 21874) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point L21871(lines 21854 21876) no Hoare annotation was computed. [2018-12-01 18:38:52,070 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21865 21872) no Hoare annotation was computed. [2018-12-01 18:38:52,071 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 21854 21876) the Hoare annotation is: true [2018-12-01 18:38:52,076 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21865 21872) no Hoare annotation was computed. [2018-12-01 18:38:52,076 INFO L444 ceAbstractionStarter]: At program point L8318(line 8318) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,076 INFO L448 ceAbstractionStarter]: For program point L8128(lines 8128 8159) no Hoare annotation was computed. [2018-12-01 18:38:52,076 INFO L448 ceAbstractionStarter]: For program point L8318-1(line 8318) no Hoare annotation was computed. [2018-12-01 18:38:52,076 INFO L448 ceAbstractionStarter]: For program point L8112-1(lines 8112 8334) no Hoare annotation was computed. [2018-12-01 18:38:52,076 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 7710 8345) no Hoare annotation was computed. [2018-12-01 18:38:52,076 INFO L448 ceAbstractionStarter]: For program point L8112(lines 8112 8334) no Hoare annotation was computed. [2018-12-01 18:38:52,076 INFO L448 ceAbstractionStarter]: For program point L8170(lines 8170 8187) no Hoare annotation was computed. [2018-12-01 18:38:52,076 INFO L444 ceAbstractionStarter]: At program point L7980(lines 7975 7981) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,077 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 7710 8345) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,077 INFO L448 ceAbstractionStarter]: For program point L8170-2(lines 8170 8187) no Hoare annotation was computed. [2018-12-01 18:38:52,077 INFO L448 ceAbstractionStarter]: For program point L8195-1(lines 8195 8199) no Hoare annotation was computed. [2018-12-01 18:38:52,077 INFO L448 ceAbstractionStarter]: For program point L8195(lines 8195 8199) no Hoare annotation was computed. [2018-12-01 18:38:52,077 INFO L444 ceAbstractionStarter]: At program point L8220loopEntry(lines 8220 8223) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (<= FloppyStartDevice_~ntStatus~4 0)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,077 INFO L444 ceAbstractionStarter]: At program point L8022(line 8022) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,077 INFO L448 ceAbstractionStarter]: For program point L8080-2(lines 8080 8092) no Hoare annotation was computed. [2018-12-01 18:38:52,077 INFO L448 ceAbstractionStarter]: For program point L8080(lines 8080 8092) no Hoare annotation was computed. [2018-12-01 18:38:52,077 INFO L448 ceAbstractionStarter]: For program point L8138(lines 8138 8155) no Hoare annotation was computed. [2018-12-01 18:38:52,077 INFO L444 ceAbstractionStarter]: At program point L8130(line 8130) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,082 INFO L444 ceAbstractionStarter]: At program point L8163(lines 8123 8236) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,082 INFO L444 ceAbstractionStarter]: At program point L7973(lines 7944 8344) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,082 INFO L448 ceAbstractionStarter]: For program point L8130-1(line 8130) no Hoare annotation was computed. [2018-12-01 18:38:52,082 INFO L448 ceAbstractionStarter]: For program point L8015(lines 8015 8028) no Hoare annotation was computed. [2018-12-01 18:38:52,083 INFO L444 ceAbstractionStarter]: At program point L7966(lines 7944 8344) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,083 INFO L448 ceAbstractionStarter]: For program point L8123(lines 8123 8236) no Hoare annotation was computed. [2018-12-01 18:38:52,083 INFO L444 ceAbstractionStarter]: At program point L8214(lines 8214 8216) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,083 INFO L448 ceAbstractionStarter]: For program point L8247(lines 8247 8283) no Hoare annotation was computed. [2018-12-01 18:38:52,083 INFO L448 ceAbstractionStarter]: For program point L8214-1(lines 8214 8216) no Hoare annotation was computed. [2018-12-01 18:38:52,083 INFO L448 ceAbstractionStarter]: For program point L8247-2(lines 8247 8283) no Hoare annotation was computed. [2018-12-01 18:38:52,083 INFO L448 ceAbstractionStarter]: For program point L8305-1(line 8305) no Hoare annotation was computed. [2018-12-01 18:38:52,083 INFO L444 ceAbstractionStarter]: At program point L8305(line 8305) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= FloppyStartDevice_~ntStatus~4 259))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,083 INFO L444 ceAbstractionStarter]: At program point L8008-1(line 8008) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,083 INFO L444 ceAbstractionStarter]: At program point L8008(line 8008) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,088 INFO L448 ceAbstractionStarter]: For program point L8297-1(lines 8297 8298) no Hoare annotation was computed. [2018-12-01 18:38:52,088 INFO L444 ceAbstractionStarter]: At program point L8297(lines 8297 8298) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,089 INFO L448 ceAbstractionStarter]: For program point L7984-1(line 7984) no Hoare annotation was computed. [2018-12-01 18:38:52,089 INFO L444 ceAbstractionStarter]: At program point L7984(line 7984) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,089 INFO L444 ceAbstractionStarter]: At program point L8017(line 8017) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,089 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 7710 8345) no Hoare annotation was computed. [2018-12-01 18:38:52,089 INFO L448 ceAbstractionStarter]: For program point L8009(line 8009) no Hoare annotation was computed. [2018-12-01 18:38:52,089 INFO L444 ceAbstractionStarter]: At program point L8191-2(lines 8191 8233) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (not (= 6 |old(~s~0)|)) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0) (= ~PagingReferenceCount~0 1)))) (or (and .cse0 (not (= FloppyStartDevice_~ntStatus~4 259))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyStartDevice_~InterfaceType~0) .cse0))) [2018-12-01 18:38:52,089 INFO L448 ceAbstractionStarter]: For program point L8192(line 8192) no Hoare annotation was computed. [2018-12-01 18:38:52,089 INFO L448 ceAbstractionStarter]: For program point L8341-1(line 8341) no Hoare annotation was computed. [2018-12-01 18:38:52,089 INFO L444 ceAbstractionStarter]: At program point L8341(line 8341) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,089 INFO L444 ceAbstractionStarter]: At program point L8110(line 8110) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,089 INFO L444 ceAbstractionStarter]: At program point L8234(lines 8112 8332) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,096 INFO L448 ceAbstractionStarter]: For program point L8300-2(lines 8300 8309) no Hoare annotation was computed. [2018-12-01 18:38:52,096 INFO L448 ceAbstractionStarter]: For program point L8300(lines 8300 8309) no Hoare annotation was computed. [2018-12-01 18:38:52,096 INFO L448 ceAbstractionStarter]: For program point L8110-1(line 8110) no Hoare annotation was computed. [2018-12-01 18:38:52,096 INFO L444 ceAbstractionStarter]: At program point L7962loopEntry(lines 7962 7965) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-01 18:38:52,097 INFO L448 ceAbstractionStarter]: For program point L8218(lines 8218 8229) no Hoare annotation was computed. [2018-12-01 18:38:52,097 INFO L444 ceAbstractionStarter]: At program point L8086(lines 8086 8087) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= FloppyStartDevice_~ntStatus~4 259)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (< 258 FloppyStartDevice_~ntStatus~4)) (.cse4 (not (= 0 ~compRegistered~0))) (.cse5 (= 1 ~setEventCalled~0)) (.cse6 (= ~PagingReferenceCount~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 1 ~s~0) .cse5 .cse6) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 .cse1 .cse2 .cse3 (= 6 ~s~0) .cse4 .cse5 .cse6))) [2018-12-01 18:38:52,097 INFO L448 ceAbstractionStarter]: For program point L8020-1(lines 8015 8028) no Hoare annotation was computed. [2018-12-01 18:38:52,097 INFO L448 ceAbstractionStarter]: For program point L8020(lines 8020 8027) no Hoare annotation was computed. [2018-12-01 18:38:52,097 INFO L448 ceAbstractionStarter]: For program point L8086-1(lines 8086 8087) no Hoare annotation was computed. [2018-12-01 18:38:52,097 INFO L444 ceAbstractionStarter]: At program point L8078(line 8078) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~customIrp~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,097 INFO L448 ceAbstractionStarter]: For program point L8078-1(line 8078) no Hoare annotation was computed. [2018-12-01 18:38:52,097 INFO L444 ceAbstractionStarter]: At program point L8326(line 8326) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,097 INFO L444 ceAbstractionStarter]: At program point L8326-1(line 8326) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,097 INFO L451 ceAbstractionStarter]: At program point ExFreePoolENTRY(lines 20949 20955) the Hoare annotation is: true [2018-12-01 18:38:52,105 INFO L448 ceAbstractionStarter]: For program point ExFreePoolFINAL(lines 20949 20955) no Hoare annotation was computed. [2018-12-01 18:38:52,105 INFO L448 ceAbstractionStarter]: For program point ExFreePoolEXIT(lines 20949 20955) no Hoare annotation was computed. [2018-12-01 18:38:52,105 INFO L448 ceAbstractionStarter]: For program point L21746(lines 21730 21751) no Hoare annotation was computed. [2018-12-01 18:38:52,105 INFO L448 ceAbstractionStarter]: For program point L21735(lines 21735 21749) no Hoare annotation was computed. [2018-12-01 18:38:52,105 INFO L451 ceAbstractionStarter]: At program point L21736(lines 21735 21749) the Hoare annotation is: true [2018-12-01 18:38:52,105 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 21730 21751) no Hoare annotation was computed. [2018-12-01 18:38:52,105 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 21730 21751) the Hoare annotation is: true [2018-12-01 18:38:52,105 INFO L451 ceAbstractionStarter]: At program point L21739(lines 21738 21748) the Hoare annotation is: true [2018-12-01 18:38:52,105 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21740 21747) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21740 21747) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L451 ceAbstractionStarter]: At program point L21139(line 21139) the Hoare annotation is: true [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point L21139-1(line 21139) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point L21151(lines 21118 21156) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 21118 21156) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 ~s~0))) (not (= |old(~customIrp~0)| 0))) (= 0 ~customIrp~0)) [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 21118 21156) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L451 ceAbstractionStarter]: At program point L21134(lines 21133 21153) the Hoare annotation is: true [2018-12-01 18:38:52,106 INFO L451 ceAbstractionStarter]: At program point L21131(lines 21130 21154) the Hoare annotation is: true [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21135 21152) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point L21130(lines 21130 21154) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21135 21152) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 21590 21597) the Hoare annotation is: true [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 21590 21597) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 21590 21597) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 20678 20691) no Hoare annotation was computed. [2018-12-01 18:38:52,106 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 20678 20691) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= ~PagingReferenceCount~0 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-01 18:38:52,113 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 20678 20691) no Hoare annotation was computed. [2018-12-01 18:38:52,113 INFO L448 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2559 2774) no Hoare annotation was computed. [2018-12-01 18:38:52,114 INFO L448 ceAbstractionStarter]: For program point L2744(lines 2744 2753) no Hoare annotation was computed. [2018-12-01 18:38:52,114 INFO L451 ceAbstractionStarter]: At program point DriverEntryENTRY(lines 2559 2774) the Hoare annotation is: true [2018-12-01 18:38:52,114 INFO L448 ceAbstractionStarter]: For program point L2744-2(lines 2744 2753) no Hoare annotation was computed. [2018-12-01 18:38:52,114 INFO L448 ceAbstractionStarter]: For program point L2709-1(line 2709) no Hoare annotation was computed. [2018-12-01 18:38:52,114 INFO L444 ceAbstractionStarter]: At program point L2709(line 2709) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (= 0 DriverEntry_~ntStatus~0) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-01 18:38:52,114 INFO L448 ceAbstractionStarter]: For program point L2716(lines 2716 2720) no Hoare annotation was computed. [2018-12-01 18:38:52,114 INFO L444 ceAbstractionStarter]: At program point L2650(lines 2645 2651) the Hoare annotation is: (or (= 0 DriverEntry_~ntStatus~0) (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-01 18:38:52,114 INFO L448 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2559 2774) no Hoare annotation was computed. [2018-12-01 18:38:52,114 INFO L444 ceAbstractionStarter]: At program point L2646loopEntry(lines 2646 2649) the Hoare annotation is: (or (= 0 DriverEntry_~ntStatus~0) (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-01 18:38:52,114 INFO L448 ceAbstractionStarter]: For program point L2735-1(line 2735) no Hoare annotation was computed. [2018-12-01 18:38:52,114 INFO L444 ceAbstractionStarter]: At program point L2735(line 2735) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (= 0 DriverEntry_~ntStatus~0) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-01 18:38:52,114 INFO L448 ceAbstractionStarter]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2018-12-01 18:38:52,114 INFO L444 ceAbstractionStarter]: At program point L2733(line 2733) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (= 0 DriverEntry_~ntStatus~0) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-01 18:38:52,114 INFO L448 ceAbstractionStarter]: For program point L2762(lines 2762 2770) no Hoare annotation was computed. [2018-12-01 18:38:52,115 INFO L448 ceAbstractionStarter]: For program point L2762-2(lines 2762 2770) no Hoare annotation was computed. [2018-12-01 18:38:52,115 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,115 INFO L451 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,115 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,115 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,120 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceEXIT(lines 21400 21406) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L451 ceAbstractionStarter]: At program point IoSetHardErrorOrVerifyDeviceENTRY(lines 21400 21406) the Hoare annotation is: true [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceFINAL(lines 21400 21406) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19380(lines 19380 19471) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19285(line 19285) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19335(lines 19335 19477) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19310(lines 19310 19314) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19405(lines 19405 19467) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19434(lines 19434 19456) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19352(lines 19352 19475) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19393(lines 19393 19469) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19427(lines 19427 19458) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19448(lines 19448 19452) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19415(lines 19415 19464) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19415-2(lines 19415 19464) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 19162 19480) no Hoare annotation was computed. [2018-12-01 18:38:52,121 INFO L448 ceAbstractionStarter]: For program point L19295-1(lines 19295 19318) no Hoare annotation was computed. [2018-12-01 18:38:52,122 INFO L448 ceAbstractionStarter]: For program point L19295(lines 19295 19318) no Hoare annotation was computed. [2018-12-01 18:38:52,122 INFO L451 ceAbstractionStarter]: At program point L19324(lines 19283 19325) the Hoare annotation is: true [2018-12-01 18:38:52,122 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 19162 19480) no Hoare annotation was computed. [2018-12-01 18:38:52,122 INFO L451 ceAbstractionStarter]: At program point L19284-2(lines 19284 19323) the Hoare annotation is: true [2018-12-01 18:38:52,122 INFO L448 ceAbstractionStarter]: For program point L19420(lines 19420 19460) no Hoare annotation was computed. [2018-12-01 18:38:52,122 INFO L448 ceAbstractionStarter]: For program point L19367(lines 19367 19473) no Hoare annotation was computed. [2018-12-01 18:38:52,122 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 19162 19480) the Hoare annotation is: true [2018-12-01 18:38:52,122 INFO L448 ceAbstractionStarter]: For program point L19441(lines 19441 19454) no Hoare annotation was computed. [2018-12-01 18:38:52,122 INFO L448 ceAbstractionStarter]: For program point IoDetachDeviceEXIT(lines 21248 21254) no Hoare annotation was computed. [2018-12-01 18:38:52,129 INFO L448 ceAbstractionStarter]: For program point IoDetachDeviceFINAL(lines 21248 21254) no Hoare annotation was computed. [2018-12-01 18:38:52,129 INFO L451 ceAbstractionStarter]: At program point IoDetachDeviceENTRY(lines 21248 21254) the Hoare annotation is: true [2018-12-01 18:38:52,129 INFO L448 ceAbstractionStarter]: For program point L19766(lines 19766 19779) no Hoare annotation was computed. [2018-12-01 18:38:52,129 INFO L444 ceAbstractionStarter]: At program point L19764(line 19764) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (= 1 ~s~0)) [2018-12-01 18:38:52,129 INFO L448 ceAbstractionStarter]: For program point L19766-2(lines 19766 19779) no Hoare annotation was computed. [2018-12-01 18:38:52,129 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 19685 19782) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-01 18:38:52,129 INFO L448 ceAbstractionStarter]: For program point L19764-1(line 19764) no Hoare annotation was computed. [2018-12-01 18:38:52,129 INFO L444 ceAbstractionStarter]: At program point L19772(line 19772) the Hoare annotation is: (let ((.cse0 (= 259 FlFdcDeviceIo_~ntStatus~16)) (.cse1 (= 1 ~setEventCalled~0))) (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= 6 ~s~0) .cse1) (and .cse0 (= 1 ~s~0) .cse1))) [2018-12-01 18:38:52,129 INFO L448 ceAbstractionStarter]: For program point L19772-1(line 19772) no Hoare annotation was computed. [2018-12-01 18:38:52,129 INFO L448 ceAbstractionStarter]: For program point L19729-1(lines 19729 19730) no Hoare annotation was computed. [2018-12-01 18:38:52,130 INFO L444 ceAbstractionStarter]: At program point L19729(lines 19729 19730) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-01 18:38:52,130 INFO L448 ceAbstractionStarter]: For program point L19736(lines 19736 19747) no Hoare annotation was computed. [2018-12-01 18:38:52,130 INFO L444 ceAbstractionStarter]: At program point L19742(lines 19737 19743) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0)))) [2018-12-01 18:38:52,130 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 19685 19782) no Hoare annotation was computed. [2018-12-01 18:38:52,130 INFO L444 ceAbstractionStarter]: At program point L19738loopEntry(lines 19738 19741) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0)))) [2018-12-01 18:38:52,130 INFO L444 ceAbstractionStarter]: At program point L19718loopEntry(lines 19718 19721) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-01 18:38:52,130 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 19685 19782) no Hoare annotation was computed. [2018-12-01 18:38:52,130 INFO L444 ceAbstractionStarter]: At program point L19726(line 19726) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-01 18:38:52,136 INFO L448 ceAbstractionStarter]: For program point L19726-1(line 19726) no Hoare annotation was computed. [2018-12-01 18:38:52,136 INFO L444 ceAbstractionStarter]: At program point L19722(lines 19717 19723) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point L21334(lines 21306 21339) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 21306 21339) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 21306 21339) the Hoare annotation is: true [2018-12-01 18:38:52,137 INFO L451 ceAbstractionStarter]: At program point L21327(lines 21326 21336) the Hoare annotation is: true [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point L21323(lines 21323 21337) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21328 21335) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L451 ceAbstractionStarter]: At program point L21324(lines 21323 21337) the Hoare annotation is: true [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21328 21335) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point L21241(lines 21226 21246) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L451 ceAbstractionStarter]: At program point L21234(lines 21233 21243) the Hoare annotation is: true [2018-12-01 18:38:52,137 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 21226 21246) the Hoare annotation is: true [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 21226 21246) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L451 ceAbstractionStarter]: At program point L21231(lines 21230 21244) the Hoare annotation is: true [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point L21230(lines 21230 21244) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21235 21242) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21235 21242) no Hoare annotation was computed. [2018-12-01 18:38:52,137 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4280 4285) the Hoare annotation is: true [2018-12-01 18:38:52,138 INFO L448 ceAbstractionStarter]: For program point L4282(line 4282) no Hoare annotation was computed. [2018-12-01 18:38:52,138 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4280 4285) no Hoare annotation was computed. [2018-12-01 18:38:52,138 INFO L448 ceAbstractionStarter]: For program point L4281-2(lines 4280 4285) no Hoare annotation was computed. [2018-12-01 18:38:52,138 INFO L448 ceAbstractionStarter]: For program point L4281(lines 4281 4283) no Hoare annotation was computed. [2018-12-01 18:38:52,138 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4282) no Hoare annotation was computed. [2018-12-01 18:38:52,138 INFO L448 ceAbstractionStarter]: For program point MmResetDriverPagingFINAL(lines 21709 21715) no Hoare annotation was computed. [2018-12-01 18:38:52,143 INFO L448 ceAbstractionStarter]: For program point MmResetDriverPagingEXIT(lines 21709 21715) no Hoare annotation was computed. [2018-12-01 18:38:52,143 INFO L451 ceAbstractionStarter]: At program point MmResetDriverPagingENTRY(lines 21709 21715) the Hoare annotation is: true [2018-12-01 18:38:52,143 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 21344 21367) no Hoare annotation was computed. [2018-12-01 18:38:52,143 INFO L448 ceAbstractionStarter]: For program point L21362(lines 21344 21367) no Hoare annotation was computed. [2018-12-01 18:38:52,143 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 21344 21367) the Hoare annotation is: true [2018-12-01 18:38:52,143 INFO L448 ceAbstractionStarter]: For program point L21351(lines 21351 21365) no Hoare annotation was computed. [2018-12-01 18:38:52,143 INFO L451 ceAbstractionStarter]: At program point L21352(lines 21351 21365) the Hoare annotation is: true [2018-12-01 18:38:52,143 INFO L451 ceAbstractionStarter]: At program point L21355(lines 21354 21364) the Hoare annotation is: true [2018-12-01 18:38:52,143 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21356 21363) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21356 21363) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L451 ceAbstractionStarter]: At program point L21383(lines 21382 21396) the Hoare annotation is: true [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 21378 21398) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point L21382(lines 21382 21396) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point L21393(lines 21378 21398) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 21378 21398) the Hoare annotation is: true [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21387 21394) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L451 ceAbstractionStarter]: At program point L21386(lines 21385 21395) the Hoare annotation is: true [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21387 21394) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L444 ceAbstractionStarter]: At program point L8855(line 8855) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point L8855-1(line 8855) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L444 ceAbstractionStarter]: At program point L9037(lines 9032 9038) the Hoare annotation is: (let ((.cse0 (= 1 ~s~0))) (or (and .cse0 (= ~PagingReferenceCount~0 1)) (and .cse0 (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point L8988(lines 8988 9021) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L448 ceAbstractionStarter]: For program point L8988-1(lines 8822 9046) no Hoare annotation was computed. [2018-12-01 18:38:52,144 INFO L444 ceAbstractionStarter]: At program point L8972(lines 8967 8973) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,149 INFO L448 ceAbstractionStarter]: For program point L8997(line 8997) no Hoare annotation was computed. [2018-12-01 18:38:52,150 INFO L444 ceAbstractionStarter]: At program point L8824loopEntry(lines 8824 8827) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,150 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteEXIT(lines 8735 9047) no Hoare annotation was computed. [2018-12-01 18:38:52,150 INFO L444 ceAbstractionStarter]: At program point L8965(lines 8958 8975) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,150 INFO L444 ceAbstractionStarter]: At program point L8990loopEntry(lines 8990 8993) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,150 INFO L444 ceAbstractionStarter]: At program point L9015(lines 9010 9016) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,150 INFO L444 ceAbstractionStarter]: At program point L8982(lines 8927 9024) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,150 INFO L444 ceAbstractionStarter]: At program point L8859(line 8859) the Hoare annotation is: (or (and (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (and (= 0 ~pended~0) (= 2 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,150 INFO L448 ceAbstractionStarter]: For program point L8859-1(line 8859) no Hoare annotation was computed. [2018-12-01 18:38:52,150 INFO L448 ceAbstractionStarter]: For program point L8958(lines 8958 8977) no Hoare annotation was computed. [2018-12-01 18:38:52,150 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteFINAL(lines 8735 9047) no Hoare annotation was computed. [2018-12-01 18:38:52,150 INFO L444 ceAbstractionStarter]: At program point L9033loopEntry(lines 9033 9036) the Hoare annotation is: (let ((.cse0 (= 1 ~s~0))) (or (and .cse0 (= ~PagingReferenceCount~0 1)) (and .cse0 (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,150 INFO L444 ceAbstractionStarter]: At program point FloppyReadWriteENTRY(lines 8735 9047) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,151 INFO L448 ceAbstractionStarter]: For program point L8893(lines 8893 8897) no Hoare annotation was computed. [2018-12-01 18:38:52,151 INFO L448 ceAbstractionStarter]: For program point L8893-2(lines 8893 8897) no Hoare annotation was computed. [2018-12-01 18:38:52,151 INFO L444 ceAbstractionStarter]: At program point L8959(lines 8944 8979) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,156 INFO L448 ceAbstractionStarter]: For program point L9026(lines 9026 9044) no Hoare annotation was computed. [2018-12-01 18:38:52,156 INFO L444 ceAbstractionStarter]: At program point L8828(lines 8823 8829) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,156 INFO L448 ceAbstractionStarter]: For program point L9018(line 9018) no Hoare annotation was computed. [2018-12-01 18:38:52,156 INFO L448 ceAbstractionStarter]: For program point L8927(lines 8927 9024) no Hoare annotation was computed. [2018-12-01 18:38:52,156 INFO L448 ceAbstractionStarter]: For program point L8853(lines 8853 8864) no Hoare annotation was computed. [2018-12-01 18:38:52,156 INFO L448 ceAbstractionStarter]: For program point L8886(lines 8886 8916) no Hoare annotation was computed. [2018-12-01 18:38:52,156 INFO L448 ceAbstractionStarter]: For program point L8944(lines 8944 8979) no Hoare annotation was computed. [2018-12-01 18:38:52,156 INFO L444 ceAbstractionStarter]: At program point L8911(line 8911) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,157 INFO L448 ceAbstractionStarter]: For program point L8878(lines 8878 8918) no Hoare annotation was computed. [2018-12-01 18:38:52,157 INFO L448 ceAbstractionStarter]: For program point L8911-1(line 8911) no Hoare annotation was computed. [2018-12-01 18:38:52,157 INFO L444 ceAbstractionStarter]: At program point L8994(lines 8989 8995) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,157 INFO L444 ceAbstractionStarter]: At program point L9011loopEntry(lines 9011 9014) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,157 INFO L444 ceAbstractionStarter]: At program point L8887(lines 8878 8918) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,157 INFO L448 ceAbstractionStarter]: For program point L8846-1(line 8846) no Hoare annotation was computed. [2018-12-01 18:38:52,157 INFO L444 ceAbstractionStarter]: At program point L8846(line 8846) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,157 INFO L444 ceAbstractionStarter]: At program point L8871(line 8871) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,157 INFO L448 ceAbstractionStarter]: For program point L8871-1(line 8871) no Hoare annotation was computed. [2018-12-01 18:38:52,157 INFO L448 ceAbstractionStarter]: For program point ObfDereferenceObjectFINAL(lines 21753 21759) no Hoare annotation was computed. [2018-12-01 18:38:52,165 INFO L451 ceAbstractionStarter]: At program point ObfDereferenceObjectENTRY(lines 21753 21759) the Hoare annotation is: true [2018-12-01 18:38:52,165 INFO L448 ceAbstractionStarter]: For program point ObfDereferenceObjectEXIT(lines 21753 21759) no Hoare annotation was computed. [2018-12-01 18:38:52,165 INFO L448 ceAbstractionStarter]: For program point KeInitializeEventEXIT(lines 21554 21560) no Hoare annotation was computed. [2018-12-01 18:38:52,165 INFO L451 ceAbstractionStarter]: At program point KeInitializeEventENTRY(lines 21554 21560) the Hoare annotation is: true [2018-12-01 18:38:52,165 INFO L448 ceAbstractionStarter]: For program point KeInitializeEventFINAL(lines 21554 21560) no Hoare annotation was computed. [2018-12-01 18:38:52,165 INFO L444 ceAbstractionStarter]: At program point L4701(line 4701) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,165 INFO L448 ceAbstractionStarter]: For program point L4701-1(line 4701) no Hoare annotation was computed. [2018-12-01 18:38:52,165 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 4673 4705) no Hoare annotation was computed. [2018-12-01 18:38:52,166 INFO L444 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 4673 4705) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,166 INFO L444 ceAbstractionStarter]: At program point L4688(lines 4683 4689) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,166 INFO L444 ceAbstractionStarter]: At program point L4684loopEntry(lines 4684 4687) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,166 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 4673 4705) no Hoare annotation was computed. [2018-12-01 18:38:52,166 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 21762 21838) no Hoare annotation was computed. [2018-12-01 18:38:52,166 INFO L448 ceAbstractionStarter]: For program point L21820(lines 21820 21826) no Hoare annotation was computed. [2018-12-01 18:38:52,166 INFO L444 ceAbstractionStarter]: At program point L21775(line 21775) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 3 |old(~s~0)|))) [2018-12-01 18:38:52,166 INFO L448 ceAbstractionStarter]: For program point L21775-1(line 21775) no Hoare annotation was computed. [2018-12-01 18:38:52,166 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 21762 21838) no Hoare annotation was computed. [2018-12-01 18:38:52,166 INFO L448 ceAbstractionStarter]: For program point L21780(lines 21780 21786) no Hoare annotation was computed. [2018-12-01 18:38:52,166 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 21762 21838) the Hoare annotation is: (or (= 3 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 3 |old(~s~0)|))) [2018-12-01 18:38:52,166 INFO L444 ceAbstractionStarter]: At program point L21792(lines 21791 21814) the Hoare annotation is: (or (= 3 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 3 |old(~s~0)|))) [2018-12-01 18:38:52,166 INFO L448 ceAbstractionStarter]: For program point L21772-1(lines 21771 21837) no Hoare annotation was computed. [2018-12-01 18:38:52,166 INFO L448 ceAbstractionStarter]: For program point L21772(lines 21772 21790) no Hoare annotation was computed. [2018-12-01 18:38:52,167 INFO L444 ceAbstractionStarter]: At program point L21810(lines 21771 21837) the Hoare annotation is: (or (= 3 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 3 |old(~s~0)|))) [2018-12-01 18:38:52,173 INFO L444 ceAbstractionStarter]: At program point L21798(lines 21797 21812) the Hoare annotation is: (or (= 3 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 3 |old(~s~0)|))) [2018-12-01 18:38:52,173 INFO L448 ceAbstractionStarter]: For program point L21794(lines 21794 21813) no Hoare annotation was computed. [2018-12-01 18:38:52,173 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 21799 21811) no Hoare annotation was computed. [2018-12-01 18:38:52,173 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 21799 21811) no Hoare annotation was computed. [2018-12-01 18:38:52,173 INFO L444 ceAbstractionStarter]: At program point L21782(line 21782) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 3 |old(~s~0)|))) [2018-12-01 18:38:52,173 INFO L448 ceAbstractionStarter]: For program point L21819(lines 21819 21834) no Hoare annotation was computed. [2018-12-01 18:38:52,173 INFO L444 ceAbstractionStarter]: At program point L21795(lines 21794 21813) the Hoare annotation is: (or (= 3 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 3 |old(~s~0)|))) [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point L21828-2(lines 21815 21835) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point L21828(lines 21828 21833) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 20988 20998) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedRemoveHeadListENTRY(lines 20988 20998) the Hoare annotation is: true [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 20988 20998) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L444 ceAbstractionStarter]: At program point L8475(lines 8470 8476) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,174 INFO L444 ceAbstractionStarter]: At program point L8698(line 8698) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point L8698-1(lines 8694 8700) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L444 ceAbstractionStarter]: At program point L8599(line 8599) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point L8599-1(line 8599) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point FloppyPowerEXIT(lines 8357 8734) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point L8525(lines 8525 8537) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point L8525-2(lines 8525 8537) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point L8550(lines 8550 8581) no Hoare annotation was computed. [2018-12-01 18:38:52,174 INFO L448 ceAbstractionStarter]: For program point L8509(lines 8509 8688) no Hoare annotation was computed. [2018-12-01 18:38:52,180 INFO L444 ceAbstractionStarter]: At program point L8658(lines 8658 8659) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,180 INFO L448 ceAbstractionStarter]: For program point L8658-1(lines 8658 8659) no Hoare annotation was computed. [2018-12-01 18:38:52,180 INFO L444 ceAbstractionStarter]: At program point L8609(lines 8604 8610) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,180 INFO L444 ceAbstractionStarter]: At program point L8576(line 8576) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,180 INFO L444 ceAbstractionStarter]: At program point L8543(line 8543) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,180 INFO L448 ceAbstractionStarter]: For program point L8576-1(line 8576) no Hoare annotation was computed. [2018-12-01 18:38:52,180 INFO L444 ceAbstractionStarter]: At program point L8510(lines 8509 8688) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point L8543-1(line 8543) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point L8692(lines 8467 8733) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L444 ceAbstractionStarter]: At program point L8618loopEntry(lines 8618 8621) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 8514 8686) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 8514 8686) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L444 ceAbstractionStarter]: At program point L8635(line 8635) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point L8635-1(line 8635) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point FloppyPowerFINAL(lines 8357 8734) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point L8594(lines 8594 8671) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L444 ceAbstractionStarter]: At program point L8685(lines 8512 8687) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point L8594-1(lines 8514 8684) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point L8528(lines 8528 8533) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L448 ceAbstractionStarter]: For program point L8603(lines 8603 8629) no Hoare annotation was computed. [2018-12-01 18:38:52,181 INFO L444 ceAbstractionStarter]: At program point L8562(lines 8557 8563) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,192 INFO L448 ceAbstractionStarter]: For program point L8603-2(lines 8603 8629) no Hoare annotation was computed. [2018-12-01 18:38:52,192 INFO L444 ceAbstractionStarter]: At program point L8471loopEntry(lines 8471 8474) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,192 INFO L444 ceAbstractionStarter]: At program point L8587(line 8587) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,192 INFO L448 ceAbstractionStarter]: For program point L8587-1(line 8587) no Hoare annotation was computed. [2018-12-01 18:38:52,192 INFO L448 ceAbstractionStarter]: For program point L8645(lines 8645 8667) no Hoare annotation was computed. [2018-12-01 18:38:52,192 INFO L444 ceAbstractionStarter]: At program point L8521(lines 8516 8522) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L444 ceAbstractionStarter]: At program point L8678(lines 8673 8679) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L444 ceAbstractionStarter]: At program point FloppyPowerENTRY(lines 8357 8734) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L444 ceAbstractionStarter]: At program point L8555(line 8555) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L444 ceAbstractionStarter]: At program point L8555-1(lines 8555 8561) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L444 ceAbstractionStarter]: At program point L8605loopEntry(lines 8605 8608) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L448 ceAbstractionStarter]: For program point L8506(lines 8506 8689) no Hoare annotation was computed. [2018-12-01 18:38:52,193 INFO L444 ceAbstractionStarter]: At program point L8622(lines 8617 8623) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L444 ceAbstractionStarter]: At program point L8507(lines 8506 8689) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L444 ceAbstractionStarter]: At program point L8730(line 8730) the Hoare annotation is: (or (= 3 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,193 INFO L448 ceAbstractionStarter]: For program point L8565(line 8565) no Hoare annotation was computed. [2018-12-01 18:38:52,193 INFO L448 ceAbstractionStarter]: For program point L8730-1(line 8730) no Hoare annotation was computed. [2018-12-01 18:38:52,193 INFO L448 ceAbstractionStarter]: For program point L8648(lines 8648 8663) no Hoare annotation was computed. [2018-12-01 18:38:52,193 INFO L448 ceAbstractionStarter]: For program point RtlFreeUnicodeStringFINAL(lines 21972 21978) no Hoare annotation was computed. [2018-12-01 18:38:52,203 INFO L448 ceAbstractionStarter]: For program point RtlFreeUnicodeStringEXIT(lines 21972 21978) no Hoare annotation was computed. [2018-12-01 18:38:52,203 INFO L451 ceAbstractionStarter]: At program point RtlFreeUnicodeStringENTRY(lines 21972 21978) the Hoare annotation is: true [2018-12-01 18:38:52,203 INFO L448 ceAbstractionStarter]: For program point L8352-1(line 8352) no Hoare annotation was computed. [2018-12-01 18:38:52,203 INFO L451 ceAbstractionStarter]: At program point L8352(line 8352) the Hoare annotation is: true [2018-12-01 18:38:52,203 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 8346 8356) the Hoare annotation is: true [2018-12-01 18:38:52,203 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 8346 8356) no Hoare annotation was computed. [2018-12-01 18:38:52,203 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 8346 8356) no Hoare annotation was computed. [2018-12-01 18:38:52,203 INFO L444 ceAbstractionStarter]: At program point L21622(line 21622) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0))) (let ((.cse5 (not (= |old(~customIrp~0)| 0))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~PagingReferenceCount~0 1))) (.cse4 (not .cse3)) (.cse2 (not (= 0 ~pended~0))) (.cse6 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (= 6 |old(~s~0)|)) .cse2 .cse3) (or (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (or .cse4 .cse2 .cse6) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse6) (or .cse4 .cse2 (not (= ~PagingReferenceCount~0 0)) .cse6)))) [2018-12-01 18:38:52,203 INFO L448 ceAbstractionStarter]: For program point L21620-1(lines 21606 21644) no Hoare annotation was computed. [2018-12-01 18:38:52,203 INFO L448 ceAbstractionStarter]: For program point L21620(lines 21620 21626) no Hoare annotation was computed. [2018-12-01 18:38:52,203 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 21602 21645) no Hoare annotation was computed. [2018-12-01 18:38:52,204 INFO L444 ceAbstractionStarter]: At program point L21630(lines 21629 21643) the Hoare annotation is: (let ((.cse10 (= ~compRegistered~0 0))) (let ((.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse9 (not (= ~PagingReferenceCount~0 1))) (.cse6 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse2 (not .cse10)) (.cse5 (not (= 0 ~pended~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse1 (= 0 ~customIrp~0)) (.cse0 (= 1 ~s~0)) (.cse3 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= 1 ~pended~0)) (and .cse0 .cse1) .cse2 .cse3 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or .cse0 .cse2 .cse5 (not (= ~PagingReferenceCount~0 0)) .cse4) (let ((.cse7 (= 1 ~setEventCalled~0))) (or (and (not (= ~customIrp~0 1)) .cse6 .cse0 .cse7) (or .cse8 .cse9 .cse5 .cse10 .cse4) (and .cse1 (= 1 |old(~customIrp~0)|) .cse0 .cse7))) (or (or .cse8 .cse9 (not (= 6 |old(~s~0)|)) .cse5 .cse10) (and .cse6 .cse0)) (or (or .cse2 .cse5 .cse4) (and .cse1 .cse0) .cse3)))) [2018-12-01 18:38:52,204 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 21634 21641) no Hoare annotation was computed. [2018-12-01 18:38:52,204 INFO L448 ceAbstractionStarter]: For program point L21608(lines 21608 21613) no Hoare annotation was computed. [2018-12-01 18:38:52,204 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 21634 21641) no Hoare annotation was computed. [2018-12-01 18:38:52,204 INFO L444 ceAbstractionStarter]: At program point L21633(lines 21632 21642) the Hoare annotation is: (let ((.cse10 (= ~compRegistered~0 0))) (let ((.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse9 (not (= ~PagingReferenceCount~0 1))) (.cse6 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse2 (not .cse10)) (.cse5 (not (= 0 ~pended~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse1 (= 0 ~customIrp~0)) (.cse0 (= 1 ~s~0)) (.cse3 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= 1 ~pended~0)) (and .cse0 .cse1) .cse2 .cse3 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or .cse0 .cse2 .cse5 (not (= ~PagingReferenceCount~0 0)) .cse4) (let ((.cse7 (= 1 ~setEventCalled~0))) (or (and (not (= ~customIrp~0 1)) .cse6 .cse0 .cse7) (or .cse8 .cse9 .cse5 .cse10 .cse4) (and .cse1 (= 1 |old(~customIrp~0)|) .cse0 .cse7))) (or (or .cse8 .cse9 (not (= 6 |old(~s~0)|)) .cse5 .cse10) (and .cse6 .cse0)) (or (or .cse2 .cse5 .cse4) (and .cse1 .cse0) .cse3)))) [2018-12-01 18:38:52,213 INFO L448 ceAbstractionStarter]: For program point L21607(lines 21607 21628) no Hoare annotation was computed. [2018-12-01 18:38:52,213 INFO L448 ceAbstractionStarter]: For program point L21640(lines 21602 21645) no Hoare annotation was computed. [2018-12-01 18:38:52,213 INFO L444 ceAbstractionStarter]: At program point L21615(lines 21607 21628) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0))) (let ((.cse7 (= 0 ~customIrp~0)) (.cse5 (not .cse3)) (.cse8 (not (= |old(~customIrp~0)| 0))) (.cse4 (= 1 ~s~0)) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse6 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (= 6 |old(~s~0)|)) .cse2 .cse3) (or .cse4 .cse5 .cse2 (not (= ~PagingReferenceCount~0 0)) .cse6) (or (and .cse4 .cse7) (or .cse5 .cse2 .cse6) .cse8) (or (not (= 1 ~pended~0)) (and (= ~s~0 |old(~s~0)|) .cse7) .cse5 .cse8 .cse6 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (and (= ~customIrp~0 |old(~customIrp~0)|) .cse4 (= 1 ~setEventCalled~0)) (or .cse0 .cse1 .cse2 .cse3 .cse6))))) [2018-12-01 18:38:52,213 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 21602 21645) the Hoare annotation is: (let ((.cse10 (= ~s~0 |old(~s~0)|)) (.cse3 (= ~compRegistered~0 0))) (let ((.cse6 (= 1 ~s~0)) (.cse8 (= 0 ~customIrp~0)) (.cse7 (not .cse3)) (.cse9 (not (= |old(~customIrp~0)| 0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse5 (and (= ~customIrp~0 |old(~customIrp~0)|) .cse10 (= 1 ~setEventCalled~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse6 .cse7 .cse2 (not (= ~PagingReferenceCount~0 0)) .cse4) (or (and .cse6 .cse8) (or .cse7 .cse2 .cse4) .cse9) (or (and .cse10 .cse8) (not (= 1 ~pended~0)) .cse7 .cse9 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (or .cse0 .cse1 (not (= 6 |old(~s~0)|)) .cse2 .cse3) .cse5)))) [2018-12-01 18:38:52,213 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 21580 21587) no Hoare annotation was computed. [2018-12-01 18:38:52,213 INFO L451 ceAbstractionStarter]: At program point KeReleaseSemaphoreENTRY(lines 21580 21587) the Hoare annotation is: true [2018-12-01 18:38:52,213 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 21580 21587) no Hoare annotation was computed. [2018-12-01 18:38:52,213 INFO L451 ceAbstractionStarter]: At program point L2784(lines 2779 2785) the Hoare annotation is: true [2018-12-01 18:38:52,213 INFO L451 ceAbstractionStarter]: At program point L2780loopEntry(lines 2780 2783) the Hoare annotation is: true [2018-12-01 18:38:52,213 INFO L451 ceAbstractionStarter]: At program point FloppyUnloadENTRY(lines 2775 2792) the Hoare annotation is: true [2018-12-01 18:38:52,213 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadEXIT(lines 2775 2792) no Hoare annotation was computed. [2018-12-01 18:38:52,214 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadFINAL(lines 2775 2792) no Hoare annotation was computed. [2018-12-01 18:38:52,221 INFO L451 ceAbstractionStarter]: At program point L2788(line 2788) the Hoare annotation is: true [2018-12-01 18:38:52,221 INFO L444 ceAbstractionStarter]: At program point L21513(line 21513) the Hoare annotation is: (let ((.cse0 (not (= 0 ~pended~0))) (.cse2 (not (= ~compRegistered~0 0))) (.cse1 (not (= 1 |old(~s~0)|)))) (and (or (not (= ~PagingReferenceCount~0 1)) .cse0 .cse1) (or .cse2 (not (= ~PagingReferenceCount~0 0)) .cse1) (or .cse2 .cse0 .cse1) (or .cse2 .cse1 (= (mod ~PagingReferenceCount~0 4294967296) 0)))) [2018-12-01 18:38:52,221 INFO L448 ceAbstractionStarter]: For program point L21513-1(lines 21505 21518) no Hoare annotation was computed. [2018-12-01 18:38:52,221 INFO L448 ceAbstractionStarter]: For program point L21509(lines 21509 21515) no Hoare annotation was computed. [2018-12-01 18:38:52,221 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 21505 21518) the Hoare annotation is: (let ((.cse2 (= 1 ~s~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 ~pended~0))) (.cse3 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse2 .cse0 (not (= ~PagingReferenceCount~0 0)) .cse3) (or .cse2 .cse0 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (or (not (= ~PagingReferenceCount~0 1)) .cse1 .cse3) (= ~s~0 |old(~s~0)|)))) [2018-12-01 18:38:52,221 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 21505 21518) no Hoare annotation was computed. [2018-12-01 18:38:52,221 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,221 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,221 INFO L451 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,221 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,221 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,222 INFO L451 ceAbstractionStarter]: At program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,222 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,222 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,222 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,222 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,222 INFO L451 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 2106 2110) the Hoare annotation is: true [2018-12-01 18:38:52,222 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 2106 2110) no Hoare annotation was computed. [2018-12-01 18:38:52,222 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 2106 2110) no Hoare annotation was computed. [2018-12-01 18:38:52,222 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,222 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,222 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,222 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,228 INFO L451 ceAbstractionStarter]: At program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point MmPageEntireDriverEXIT(lines 21701 21707) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L451 ceAbstractionStarter]: At program point MmPageEntireDriverENTRY(lines 21701 21707) the Hoare annotation is: true [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point MmPageEntireDriverFINAL(lines 21701 21707) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L451 ceAbstractionStarter]: At program point L21958(lines 21957 21967) the Hoare annotation is: true [2018-12-01 18:38:52,229 INFO L451 ceAbstractionStarter]: At program point L21955(lines 21954 21968) the Hoare annotation is: true [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point L21954(lines 21954 21968) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 21949 21970) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L451 ceAbstractionStarter]: At program point RtlDeleteRegistryValueENTRY(lines 21949 21970) the Hoare annotation is: true [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21959 21966) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point L21965(lines 21949 21970) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21959 21966) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point mallocFINAL(lines 20907 20913) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point mallocEXIT(lines 20907 20913) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L451 ceAbstractionStarter]: At program point mallocENTRY(lines 20907 20913) the Hoare annotation is: true [2018-12-01 18:38:52,229 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,229 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,229 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,230 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,230 INFO L448 ceAbstractionStarter]: For program point IoDeleteDeviceEXIT(lines 21218 21224) no Hoare annotation was computed. [2018-12-01 18:38:52,230 INFO L448 ceAbstractionStarter]: For program point IoDeleteDeviceFINAL(lines 21218 21224) no Hoare annotation was computed. [2018-12-01 18:38:52,230 INFO L451 ceAbstractionStarter]: At program point IoDeleteDeviceENTRY(lines 21218 21224) the Hoare annotation is: true [2018-12-01 18:38:52,230 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,230 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,230 INFO L451 ceAbstractionStarter]: At program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,230 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,230 INFO L448 ceAbstractionStarter]: For program point ExAcquireFastMutexEXIT(lines 20915 20921) no Hoare annotation was computed. [2018-12-01 18:38:52,242 INFO L451 ceAbstractionStarter]: At program point ExAcquireFastMutexENTRY(lines 20915 20921) the Hoare annotation is: true [2018-12-01 18:38:52,242 INFO L448 ceAbstractionStarter]: For program point ExAcquireFastMutexFINAL(lines 20915 20921) no Hoare annotation was computed. [2018-12-01 18:38:52,242 INFO L448 ceAbstractionStarter]: For program point L22009(lines 22009 22023) no Hoare annotation was computed. [2018-12-01 18:38:52,242 INFO L448 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 22003 22025) no Hoare annotation was computed. [2018-12-01 18:38:52,242 INFO L451 ceAbstractionStarter]: At program point RtlQueryRegistryValuesENTRY(lines 22003 22025) the Hoare annotation is: true [2018-12-01 18:38:52,242 INFO L451 ceAbstractionStarter]: At program point L22010(lines 22009 22023) the Hoare annotation is: true [2018-12-01 18:38:52,242 INFO L451 ceAbstractionStarter]: At program point L22013(lines 22012 22022) the Hoare annotation is: true [2018-12-01 18:38:52,242 INFO L448 ceAbstractionStarter]: For program point L22020(lines 22003 22025) no Hoare annotation was computed. [2018-12-01 18:38:52,242 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 22014 22021) no Hoare annotation was computed. [2018-12-01 18:38:52,242 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 22014 22021) no Hoare annotation was computed. [2018-12-01 18:38:52,242 INFO L448 ceAbstractionStarter]: For program point L21490(lines 21490 21497) no Hoare annotation was computed. [2018-12-01 18:38:52,243 INFO L444 ceAbstractionStarter]: At program point L21457(lines 21456 21475) the Hoare annotation is: (let ((.cse7 (= ~compRegistered~0 0))) (let ((.cse0 (= 3 ~s~0)) (.cse2 (not (= 0 ~pended~0))) (.cse6 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not .cse7)) (.cse3 (not (= 3 |old(~s~0)|))) (.cse5 (= ~s~0 |old(~s~0)|)) (.cse4 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~PagingReferenceCount~0 0)) .cse3) (or (or .cse1 .cse2 .cse3) .cse4 .cse5) (or .cse6 .cse1 .cse2 .cse0 .cse3) (or (or (or .cse2 .cse7 (not (= 1 |old(~s~0)|))) .cse6) (and (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5))) (or (not (= 1 ~pended~0)) .cse1 .cse3 .cse5 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-01 18:38:52,243 INFO L448 ceAbstractionStarter]: For program point L21482(lines 21482 21488) no Hoare annotation was computed. [2018-12-01 18:38:52,243 INFO L444 ceAbstractionStarter]: At program point L21495(line 21495) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0))) (let ((.cse2 (not (= ~PagingReferenceCount~0 1))) (.cse5 (not (= ~customIrp~0 0))) (.cse3 (not .cse1)) (.cse0 (not (= 0 ~pended~0))) (.cse4 (not (= 3 |old(~s~0)|)))) (and (or (or .cse0 .cse1 (not (= 1 |old(~s~0)|))) .cse2) (or (or .cse3 .cse0 .cse4) .cse5) (or .cse2 .cse3 .cse0 .cse4) (or (not (= 1 ~pended~0)) .cse3 .cse4 .cse5 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or .cse3 .cse0 (not (= ~PagingReferenceCount~0 0)) .cse4)))) [2018-12-01 18:38:52,243 INFO L448 ceAbstractionStarter]: For program point L21495-1(lines 21477 21499) no Hoare annotation was computed. [2018-12-01 18:38:52,243 INFO L444 ceAbstractionStarter]: At program point L21437(line 21437) the Hoare annotation is: (let ((.cse4 (= ~compRegistered~0 0))) (let ((.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse3 (not (= ~customIrp~0 0))) (.cse0 (not .cse4)) (.cse1 (not (= 0 ~pended~0))) (.cse2 (not (= 3 |old(~s~0)|)))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or (= 1 ~s~0) (or (or .cse1 .cse4 (not (= 1 |old(~s~0)|))) .cse5)) (or .cse5 .cse0 .cse1 .cse2) (or (not (= 1 ~pended~0)) .cse0 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or .cse0 .cse1 (not (= ~PagingReferenceCount~0 0)) .cse2)))) [2018-12-01 18:38:52,243 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 21423 21502) the Hoare annotation is: (let ((.cse4 (= ~compRegistered~0 0))) (let ((.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse0 (= 3 ~s~0)) (.cse1 (not .cse4)) (.cse3 (not (= 3 |old(~s~0)|))) (.cse7 (= ~s~0 |old(~s~0)|)) (.cse6 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~PagingReferenceCount~0 0)) .cse3) (or (= 1 ~s~0) (or (or .cse2 .cse4 (not (= 1 |old(~s~0)|))) .cse5)) (or (or .cse1 .cse2 .cse3) .cse6 .cse7) (or .cse5 .cse1 .cse2 .cse0 .cse3) (or (not (= 1 ~pended~0)) .cse1 .cse3 .cse7 .cse6 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-01 18:38:52,252 INFO L448 ceAbstractionStarter]: For program point L21437-1(line 21437) no Hoare annotation was computed. [2018-12-01 18:38:52,252 INFO L448 ceAbstractionStarter]: For program point L21442(lines 21442 21448) no Hoare annotation was computed. [2018-12-01 18:38:52,253 INFO L444 ceAbstractionStarter]: At program point L21454(lines 21453 21476) the Hoare annotation is: (let ((.cse7 (= ~compRegistered~0 0))) (let ((.cse0 (= 3 ~s~0)) (.cse2 (not (= 0 ~pended~0))) (.cse6 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not .cse7)) (.cse3 (not (= 3 |old(~s~0)|))) (.cse5 (= ~s~0 |old(~s~0)|)) (.cse4 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~PagingReferenceCount~0 0)) .cse3) (or (or .cse1 .cse2 .cse3) .cse4 .cse5) (or .cse6 .cse1 .cse2 .cse0 .cse3) (or (or (or .cse2 .cse7 (not (= 1 |old(~s~0)|))) .cse6) (and (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5))) (or (not (= 1 ~pended~0)) .cse1 .cse3 .cse5 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-01 18:38:52,253 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 21423 21502) no Hoare annotation was computed. [2018-12-01 18:38:52,253 INFO L448 ceAbstractionStarter]: For program point L21434-1(lines 21433 21501) no Hoare annotation was computed. [2018-12-01 18:38:52,253 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 21423 21502) no Hoare annotation was computed. [2018-12-01 18:38:52,253 INFO L448 ceAbstractionStarter]: For program point L21434(lines 21434 21452) no Hoare annotation was computed. [2018-12-01 18:38:52,253 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 21461 21473) no Hoare annotation was computed. [2018-12-01 18:38:52,253 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 21461 21473) no Hoare annotation was computed. [2018-12-01 18:38:52,253 INFO L444 ceAbstractionStarter]: At program point L21460(lines 21459 21474) the Hoare annotation is: (let ((.cse7 (= ~compRegistered~0 0))) (let ((.cse0 (= 3 ~s~0)) (.cse2 (not (= 0 ~pended~0))) (.cse6 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not .cse7)) (.cse3 (not (= 3 |old(~s~0)|))) (.cse5 (= ~s~0 |old(~s~0)|)) (.cse4 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~PagingReferenceCount~0 0)) .cse3) (or (or .cse1 .cse2 .cse3) .cse4 .cse5) (or .cse6 .cse1 .cse2 .cse0 .cse3) (or (or (or .cse2 .cse7 (not (= 1 |old(~s~0)|))) .cse6) (and (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5))) (or (not (= 1 ~pended~0)) .cse1 .cse3 .cse5 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-01 18:38:52,253 INFO L444 ceAbstractionStarter]: At program point L21472(lines 21433 21501) the Hoare annotation is: (let ((.cse8 (= ~compRegistered~0 0))) (let ((.cse9 (not (= ~PagingReferenceCount~0 1))) (.cse2 (= 3 ~s~0)) (.cse0 (not .cse8)) (.cse4 (not (= 0 ~pended~0))) (.cse1 (not (= 3 |old(~s~0)|))) (.cse3 (not (= ~customIrp~0 0)))) (and (or (not (= 1 ~pended~0)) .cse0 .cse1 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or .cse0 .cse4 (not (= ~PagingReferenceCount~0 0)) .cse2 .cse1) (let ((.cse5 (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802))) (.cse6 (= 1 ~setEventCalled~0)) (.cse7 (= ~s~0 5))) (or (and .cse5 .cse6 (= IofCallDriver_~returnVal2~0 259) .cse7) (or (or .cse4 .cse8 (not (= 1 |old(~s~0)|))) .cse9) (and .cse5 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse6 .cse7) (and .cse5 (= 0 IofCallDriver_~returnVal2~0) .cse6 .cse7))) (or (= ~s~0 |old(~s~0)|) .cse9 .cse0 .cse4 .cse1) (or .cse2 (or .cse0 .cse4 .cse1) .cse3)))) [2018-12-01 18:38:52,267 INFO L448 ceAbstractionStarter]: For program point L21481(lines 21481 21498) no Hoare annotation was computed. [2018-12-01 18:38:52,268 INFO L444 ceAbstractionStarter]: At program point L21444(line 21444) the Hoare annotation is: (let ((.cse4 (= ~compRegistered~0 0))) (let ((.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse3 (not (= ~customIrp~0 0))) (.cse0 (not .cse4)) (.cse1 (not (= 0 ~pended~0))) (.cse2 (not (= 3 |old(~s~0)|)))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or (or (or .cse1 .cse4 (not (= 1 |old(~s~0)|))) .cse5) (and (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802)) (= 1 ~s~0) (= 1 ~setEventCalled~0))) (or .cse5 .cse0 .cse1 .cse2) (or (not (= 1 ~pended~0)) .cse0 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or .cse0 .cse1 (not (= ~PagingReferenceCount~0 0)) .cse2)))) [2018-12-01 18:38:52,268 INFO L448 ceAbstractionStarter]: For program point L21456(lines 21456 21475) no Hoare annotation was computed. [2018-12-01 18:38:52,268 INFO L448 ceAbstractionStarter]: For program point L4606(lines 4606 4610) no Hoare annotation was computed. [2018-12-01 18:38:52,268 INFO L448 ceAbstractionStarter]: For program point L4668-1(line 4668) no Hoare annotation was computed. [2018-12-01 18:38:52,268 INFO L444 ceAbstractionStarter]: At program point L4602(line 4602) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3) (or (and .cse0 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3))) [2018-12-01 18:38:52,268 INFO L444 ceAbstractionStarter]: At program point L4668(line 4668) the Hoare annotation is: (let ((.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 ~s~0)))) (and (or (= ~PagingReferenceCount~0 1) (= 0 ~PagingReferenceCount~0) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse2) (or (and (= ~pended~0 1) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (not (= ~customIrp~0 0)) .cse2))) [2018-12-01 18:38:52,268 INFO L448 ceAbstractionStarter]: For program point L4503(lines 4503 4619) no Hoare annotation was computed. [2018-12-01 18:38:52,268 INFO L448 ceAbstractionStarter]: For program point L4664-1(line 4664) no Hoare annotation was computed. [2018-12-01 18:38:52,268 INFO L444 ceAbstractionStarter]: At program point L4598(line 4598) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3) (or (and .cse0 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3))) [2018-12-01 18:38:52,268 INFO L448 ceAbstractionStarter]: For program point L4602-1(line 4602) no Hoare annotation was computed. [2018-12-01 18:38:52,279 INFO L444 ceAbstractionStarter]: At program point L4664(line 4664) the Hoare annotation is: (let ((.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 ~s~0)))) (and (or (= ~PagingReferenceCount~0 1) (= 0 ~PagingReferenceCount~0) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse2) (or (and (= ~pended~0 1) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (not (= ~customIrp~0 0)) .cse2))) [2018-12-01 18:38:52,279 INFO L444 ceAbstractionStarter]: At program point L4594(lines 4594 4595) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3) (or (and .cse0 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3))) [2018-12-01 18:38:52,279 INFO L448 ceAbstractionStarter]: For program point L4598-1(line 4598) no Hoare annotation was computed. [2018-12-01 18:38:52,279 INFO L448 ceAbstractionStarter]: For program point L4594-1(lines 4594 4595) no Hoare annotation was computed. [2018-12-01 18:38:52,280 INFO L444 ceAbstractionStarter]: At program point L4454(lines 4449 4455) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3) (or (and .cse0 (= 0 ~PagingReferenceCount~0)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,280 INFO L444 ceAbstractionStarter]: At program point L4516-1(lines 4516 4523) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3) (or (and .cse0 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3))) [2018-12-01 18:38:52,280 INFO L444 ceAbstractionStarter]: At program point L4549(lines 4549 4550) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3) (or (and .cse0 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3))) [2018-12-01 18:38:52,280 INFO L448 ceAbstractionStarter]: For program point L4516(lines 4516 4523) no Hoare annotation was computed. [2018-12-01 18:38:52,280 INFO L448 ceAbstractionStarter]: For program point L4549-1(lines 4549 4550) no Hoare annotation was computed. [2018-12-01 18:38:52,280 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 4286 4672) no Hoare annotation was computed. [2018-12-01 18:38:52,280 INFO L444 ceAbstractionStarter]: At program point L4475(line 4475) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (and .cse2 (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,280 INFO L448 ceAbstractionStarter]: For program point L4442(lines 4442 4469) no Hoare annotation was computed. [2018-12-01 18:38:52,292 INFO L444 ceAbstractionStarter]: At program point L4475-1(lines 4475 4481) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (and .cse2 (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,292 INFO L444 ceAbstractionStarter]: At program point L4566(line 4566) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,293 INFO L444 ceAbstractionStarter]: At program point L4434(line 4434) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (and .cse2 (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,293 INFO L448 ceAbstractionStarter]: For program point L4566-1(line 4566) no Hoare annotation was computed. [2018-12-01 18:38:52,293 INFO L448 ceAbstractionStarter]: For program point L4434-1(line 4434) no Hoare annotation was computed. [2018-12-01 18:38:52,293 INFO L448 ceAbstractionStarter]: For program point L4554(lines 4554 4581) no Hoare annotation was computed. [2018-12-01 18:38:52,293 INFO L448 ceAbstractionStarter]: For program point L4525(line 4525) no Hoare annotation was computed. [2018-12-01 18:38:52,293 INFO L448 ceAbstractionStarter]: For program point L4488-1(line 4488) no Hoare annotation was computed. [2018-12-01 18:38:52,293 INFO L444 ceAbstractionStarter]: At program point L4649(line 4649) the Hoare annotation is: (let ((.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (not (= ~customIrp~0 0)) .cse2) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse2))) [2018-12-01 18:38:52,293 INFO L444 ceAbstractionStarter]: At program point L4488(line 4488) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (and .cse2 (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,293 INFO L448 ceAbstractionStarter]: For program point L4649-1(lines 4645 4651) no Hoare annotation was computed. [2018-12-01 18:38:52,293 INFO L448 ceAbstractionStarter]: For program point L4645(lines 4645 4651) no Hoare annotation was computed. [2018-12-01 18:38:52,293 INFO L444 ceAbstractionStarter]: At program point L4447(line 4447) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3) (or (and .cse0 (= 0 ~PagingReferenceCount~0)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,293 INFO L444 ceAbstractionStarter]: At program point L4447-1(lines 4447 4453) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3) (or (and .cse0 (= 0 ~PagingReferenceCount~0)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,306 INFO L444 ceAbstractionStarter]: At program point L4513(line 4513) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (and .cse2 (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,306 INFO L448 ceAbstractionStarter]: For program point L4513-1(line 4513) no Hoare annotation was computed. [2018-12-01 18:38:52,306 INFO L448 ceAbstractionStarter]: For program point L4563(lines 4563 4570) no Hoare annotation was computed. [2018-12-01 18:38:52,306 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 4286 4672) no Hoare annotation was computed. [2018-12-01 18:38:52,306 INFO L444 ceAbstractionStarter]: At program point L4563-2(lines 4563 4570) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,306 INFO L444 ceAbstractionStarter]: At program point L4617(line 4617) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (and .cse2 (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,306 INFO L448 ceAbstractionStarter]: For program point L4617-1(lines 4503 4619) no Hoare annotation was computed. [2018-12-01 18:38:52,306 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 4286 4672) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (and .cse2 (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,307 INFO L448 ceAbstractionStarter]: For program point L4576-1(line 4576) no Hoare annotation was computed. [2018-12-01 18:38:52,307 INFO L444 ceAbstractionStarter]: At program point L4576(line 4576) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,307 INFO L448 ceAbstractionStarter]: For program point L4572(line 4572) no Hoare annotation was computed. [2018-12-01 18:38:52,307 INFO L448 ceAbstractionStarter]: For program point L4560-1(line 4560) no Hoare annotation was computed. [2018-12-01 18:38:52,307 INFO L444 ceAbstractionStarter]: At program point L4560(line 4560) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3) (or (and .cse0 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3))) [2018-12-01 18:38:52,315 INFO L444 ceAbstractionStarter]: At program point L4519(line 4519) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (and .cse0 (= ~PagingReferenceCount~0 1)) .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3) (or (and .cse0 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) .cse1 .cse2 (not (= ~customIrp~0 0)) .cse3))) [2018-12-01 18:38:52,315 INFO L444 ceAbstractionStarter]: At program point L4482(lines 4477 4483) the Hoare annotation is: (let ((.cse2 (= 0 ~pended~0)) (.cse0 (not (= ~compRegistered~0 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse3 (not (= 1 ~s~0)))) (and (or (not (= |old(~PagingReferenceCount~0)| 1)) .cse0 .cse1 (and .cse2 (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) .cse3) (or (and .cse2 (= 0 ~PagingReferenceCount~0)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) .cse3))) [2018-12-01 18:38:52,315 INFO L448 ceAbstractionStarter]: For program point L6444(lines 6444 6464) no Hoare annotation was computed. [2018-12-01 18:38:52,316 INFO L444 ceAbstractionStarter]: At program point L6345loopEntry(lines 6345 6348) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,316 INFO L444 ceAbstractionStarter]: At program point L5487loopEntry(lines 5487 5490) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,316 INFO L448 ceAbstractionStarter]: For program point L6214(lines 6214 6223) no Hoare annotation was computed. [2018-12-01 18:38:52,316 INFO L448 ceAbstractionStarter]: For program point L6148-1(lines 6148 6150) no Hoare annotation was computed. [2018-12-01 18:38:52,316 INFO L444 ceAbstractionStarter]: At program point L6082(lines 6082 6083) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,316 INFO L444 ceAbstractionStarter]: At program point L6148(lines 6148 6150) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,316 INFO L448 ceAbstractionStarter]: For program point L6082-1(lines 6082 6083) no Hoare annotation was computed. [2018-12-01 18:38:52,316 INFO L444 ceAbstractionStarter]: At program point L5554(line 5554) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,316 INFO L448 ceAbstractionStarter]: For program point L5455(lines 5455 6422) no Hoare annotation was computed. [2018-12-01 18:38:52,316 INFO L444 ceAbstractionStarter]: At program point L5554-1(line 5554) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,325 INFO L448 ceAbstractionStarter]: For program point L5323(lines 5323 5350) no Hoare annotation was computed. [2018-12-01 18:38:52,325 INFO L448 ceAbstractionStarter]: For program point L5389(lines 5389 5431) no Hoare annotation was computed. [2018-12-01 18:38:52,325 INFO L444 ceAbstractionStarter]: At program point L6413(lines 5292 6485) the Hoare annotation is: (let ((.cse0 (= 1 ~s~0))) (or (and .cse0 (= ~PagingReferenceCount~0 1)) (and .cse0 (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-01 18:38:52,325 INFO L448 ceAbstractionStarter]: For program point L5323-2(lines 5323 5350) no Hoare annotation was computed. [2018-12-01 18:38:52,325 INFO L444 ceAbstractionStarter]: At program point L6050(lines 6045 6051) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,325 INFO L444 ceAbstractionStarter]: At program point L5918(lines 5913 5919) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,325 INFO L444 ceAbstractionStarter]: At program point L5852(lines 5467 6418) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,325 INFO L448 ceAbstractionStarter]: For program point L5687(lines 5687 5699) no Hoare annotation was computed. [2018-12-01 18:38:52,325 INFO L448 ceAbstractionStarter]: For program point L5555(line 5555) no Hoare annotation was computed. [2018-12-01 18:38:52,325 INFO L448 ceAbstractionStarter]: For program point L5621(lines 5621 5631) no Hoare annotation was computed. [2018-12-01 18:38:52,325 INFO L448 ceAbstractionStarter]: For program point L5390(lines 5390 5396) no Hoare annotation was computed. [2018-12-01 18:38:52,326 INFO L448 ceAbstractionStarter]: For program point L6447(lines 6447 6463) no Hoare annotation was computed. [2018-12-01 18:38:52,326 INFO L444 ceAbstractionStarter]: At program point L6282(line 6282) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,326 INFO L444 ceAbstractionStarter]: At program point L5357(line 5357) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,326 INFO L448 ceAbstractionStarter]: For program point L5357-1(line 5357) no Hoare annotation was computed. [2018-12-01 18:38:52,326 INFO L448 ceAbstractionStarter]: For program point L6282-1(line 6282) no Hoare annotation was computed. [2018-12-01 18:38:52,326 INFO L448 ceAbstractionStarter]: For program point L5787(lines 5787 5804) no Hoare annotation was computed. [2018-12-01 18:38:52,326 INFO L444 ceAbstractionStarter]: At program point L5820(lines 5455 6422) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,338 INFO L444 ceAbstractionStarter]: At program point L6316(lines 5473 6416) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,338 INFO L444 ceAbstractionStarter]: At program point L6349(lines 6344 6350) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,338 INFO L448 ceAbstractionStarter]: For program point L6184(lines 6184 6227) no Hoare annotation was computed. [2018-12-01 18:38:52,339 INFO L444 ceAbstractionStarter]: At program point L5689loopEntry(lines 5689 5692) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,339 INFO L444 ceAbstractionStarter]: At program point L5491(lines 5486 5492) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,339 INFO L448 ceAbstractionStarter]: For program point L5458(lines 5458 6421) no Hoare annotation was computed. [2018-12-01 18:38:52,339 INFO L448 ceAbstractionStarter]: For program point L6284-1(line 6284) no Hoare annotation was computed. [2018-12-01 18:38:52,339 INFO L444 ceAbstractionStarter]: At program point L6218(line 6218) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,339 INFO L444 ceAbstractionStarter]: At program point L6284(line 6284) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,339 INFO L448 ceAbstractionStarter]: For program point L6086(lines 6086 6091) no Hoare annotation was computed. [2018-12-01 18:38:52,339 INFO L448 ceAbstractionStarter]: For program point L6450(lines 6450 6462) no Hoare annotation was computed. [2018-12-01 18:38:52,339 INFO L444 ceAbstractionStarter]: At program point L5426(line 5426) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 3 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,339 INFO L444 ceAbstractionStarter]: At program point L5294loopEntry(lines 5294 5297) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,339 INFO L448 ceAbstractionStarter]: For program point L5426-1(line 5426) no Hoare annotation was computed. [2018-12-01 18:38:52,339 INFO L448 ceAbstractionStarter]: For program point L5889(lines 5889 5901) no Hoare annotation was computed. [2018-12-01 18:38:52,339 INFO L448 ceAbstractionStarter]: For program point L5526(lines 5526 5536) no Hoare annotation was computed. [2018-12-01 18:38:52,339 INFO L448 ceAbstractionStarter]: For program point L5592(lines 5592 5597) no Hoare annotation was computed. [2018-12-01 18:38:52,350 INFO L444 ceAbstractionStarter]: At program point L5394(line 5394) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,351 INFO L448 ceAbstractionStarter]: For program point L5394-1(lines 5390 5396) no Hoare annotation was computed. [2018-12-01 18:38:52,351 INFO L448 ceAbstractionStarter]: For program point L6154(lines 6154 6162) no Hoare annotation was computed. [2018-12-01 18:38:52,351 INFO L448 ceAbstractionStarter]: For program point L5461(lines 5461 6420) no Hoare annotation was computed. [2018-12-01 18:38:52,351 INFO L444 ceAbstractionStarter]: At program point L6188(line 6188) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,351 INFO L444 ceAbstractionStarter]: At program point L5891loopEntry(lines 5891 5894) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,351 INFO L444 ceAbstractionStarter]: At program point L5693(lines 5688 5694) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,351 INFO L448 ceAbstractionStarter]: For program point L6453(lines 6453 6461) no Hoare annotation was computed. [2018-12-01 18:38:52,351 INFO L444 ceAbstractionStarter]: At program point L5859loopEntry(lines 5859 5862) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,351 INFO L444 ceAbstractionStarter]: At program point L5298(lines 5293 5299) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,351 INFO L448 ceAbstractionStarter]: For program point L5364(lines 5364 5381) no Hoare annotation was computed. [2018-12-01 18:38:52,351 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 4706 6486) no Hoare annotation was computed. [2018-12-01 18:38:52,351 INFO L448 ceAbstractionStarter]: For program point L6058(lines 6058 6063) no Hoare annotation was computed. [2018-12-01 18:38:52,351 INFO L444 ceAbstractionStarter]: At program point L6157(line 6157) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,352 INFO L448 ceAbstractionStarter]: For program point L5464(lines 5464 6419) no Hoare annotation was computed. [2018-12-01 18:38:52,352 INFO L444 ceAbstractionStarter]: At program point L5828(lines 5458 6421) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,352 INFO L448 ceAbstractionStarter]: For program point L6456-2(lines 6437 6474) no Hoare annotation was computed. [2018-12-01 18:38:52,352 INFO L444 ceAbstractionStarter]: At program point L5465(lines 5464 6419) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,362 INFO L448 ceAbstractionStarter]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2018-12-01 18:38:52,362 INFO L444 ceAbstractionStarter]: At program point L6126(line 6126) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,362 INFO L448 ceAbstractionStarter]: For program point L6126-1(line 6126) no Hoare annotation was computed. [2018-12-01 18:38:52,362 INFO L444 ceAbstractionStarter]: At program point L5895(lines 5890 5896) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,363 INFO L448 ceAbstractionStarter]: For program point L5499(lines 5499 5504) no Hoare annotation was computed. [2018-12-01 18:38:52,363 INFO L444 ceAbstractionStarter]: At program point L6358loopEntry(lines 6358 6361) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,363 INFO L444 ceAbstractionStarter]: At program point L6292-1(line 6292) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,363 INFO L444 ceAbstractionStarter]: At program point L6292(line 6292) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,363 INFO L444 ceAbstractionStarter]: At program point L5863(lines 5858 5864) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,363 INFO L448 ceAbstractionStarter]: For program point L5797(lines 5797 5802) no Hoare annotation was computed. [2018-12-01 18:38:52,363 INFO L448 ceAbstractionStarter]: For program point L5467(lines 5467 6418) no Hoare annotation was computed. [2018-12-01 18:38:52,363 INFO L448 ceAbstractionStarter]: For program point L5335(lines 5335 5346) no Hoare annotation was computed. [2018-12-01 18:38:52,363 INFO L448 ceAbstractionStarter]: For program point L6293(line 6293) no Hoare annotation was computed. [2018-12-01 18:38:52,363 INFO L444 ceAbstractionStarter]: At program point L6095(line 6095) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,363 INFO L448 ceAbstractionStarter]: For program point L6095-1(line 6095) no Hoare annotation was computed. [2018-12-01 18:38:52,363 INFO L444 ceAbstractionStarter]: At program point L5337(line 5337) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,363 INFO L448 ceAbstractionStarter]: For program point L5337-1(line 5337) no Hoare annotation was computed. [2018-12-01 18:38:52,373 INFO L448 ceAbstractionStarter]: For program point L5470(lines 5470 6417) no Hoare annotation was computed. [2018-12-01 18:38:52,373 INFO L444 ceAbstractionStarter]: At program point L6362(lines 6357 6363) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,373 INFO L448 ceAbstractionStarter]: For program point L6263(lines 6263 6277) no Hoare annotation was computed. [2018-12-01 18:38:52,373 INFO L448 ceAbstractionStarter]: For program point L6329(lines 6329 6370) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L448 ceAbstractionStarter]: For program point L5735(lines 5735 5810) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L444 ceAbstractionStarter]: At program point L5471(lines 5470 6417) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,374 INFO L448 ceAbstractionStarter]: For program point L6429(lines 6429 6483) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L444 ceAbstractionStarter]: At program point L6331loopEntry(lines 6331 6334) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,374 INFO L448 ceAbstractionStarter]: For program point L6199(lines 6199 6225) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L444 ceAbstractionStarter]: At program point L5836loopEntry(lines 5836 5839) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,374 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 4706 6486) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L444 ceAbstractionStarter]: At program point L5671(lines 5449 6424) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,374 INFO L448 ceAbstractionStarter]: For program point L5473(lines 5473 6416) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L448 ceAbstractionStarter]: For program point L5440(lines 5440 6427) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L444 ceAbstractionStarter]: At program point L5341(line 5341) the Hoare annotation is: (or (and (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (and (= 0 ~pended~0) (= 2 ~s~0) (= 0 (+ FloppyDeviceControl_~ntStatus~2 1073741536)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,374 INFO L448 ceAbstractionStarter]: For program point L5341-1(line 5341) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L448 ceAbstractionStarter]: For program point L6365(line 6365) no Hoare annotation was computed. [2018-12-01 18:38:52,374 INFO L444 ceAbstractionStarter]: At program point L5441(lines 5440 6427) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,374 INFO L444 ceAbstractionStarter]: At program point L5574(lines 5569 5575) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L448 ceAbstractionStarter]: For program point L5376-1(line 5376) no Hoare annotation was computed. [2018-12-01 18:38:52,384 INFO L444 ceAbstractionStarter]: At program point L5376(line 5376) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L448 ceAbstractionStarter]: For program point L6169(lines 6169 6229) no Hoare annotation was computed. [2018-12-01 18:38:52,384 INFO L444 ceAbstractionStarter]: At program point L5707(line 5707) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L448 ceAbstractionStarter]: For program point L5707-1(line 5707) no Hoare annotation was computed. [2018-12-01 18:38:52,384 INFO L448 ceAbstractionStarter]: For program point L5443(lines 5443 6426) no Hoare annotation was computed. [2018-12-01 18:38:52,384 INFO L444 ceAbstractionStarter]: At program point L6335(lines 6330 6336) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L444 ceAbstractionStarter]: At program point L6203(line 6203) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L448 ceAbstractionStarter]: For program point L6071(lines 6071 6076) no Hoare annotation was computed. [2018-12-01 18:38:52,384 INFO L444 ceAbstractionStarter]: At program point L6005loopEntry(lines 6005 6008) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L444 ceAbstractionStarter]: At program point L5939-2(lines 5939 6026) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L444 ceAbstractionStarter]: At program point L5840(lines 5835 5841) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L448 ceAbstractionStarter]: For program point $Ultimate##43(lines 5478 6414) no Hoare annotation was computed. [2018-12-01 18:38:52,384 INFO L448 ceAbstractionStarter]: For program point $Ultimate##42(lines 5478 6414) no Hoare annotation was computed. [2018-12-01 18:38:52,384 INFO L444 ceAbstractionStarter]: At program point L5444(lines 5443 6426) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,384 INFO L448 ceAbstractionStarter]: For program point L5940(line 5940) no Hoare annotation was computed. [2018-12-01 18:38:52,393 INFO L448 ceAbstractionStarter]: For program point L5709(lines 5709 5721) no Hoare annotation was computed. [2018-12-01 18:38:52,393 INFO L444 ceAbstractionStarter]: At program point L6469(line 6469) the Hoare annotation is: (let ((.cse0 (= 1 ~s~0)) (.cse1 (not (= 259 FloppyDeviceControl_~ntStatus~2)))) (or (and .cse0 .cse1 (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|)) (and .cse0 .cse1 (= 0 ~PagingReferenceCount~0)))) [2018-12-01 18:38:52,393 INFO L448 ceAbstractionStarter]: For program point L5446(lines 5446 6425) no Hoare annotation was computed. [2018-12-01 18:38:52,393 INFO L444 ceAbstractionStarter]: At program point L6437-1(lines 6437 6476) the Hoare annotation is: (let ((.cse0 (= 1 ~s~0)) (.cse1 (not (= 259 FloppyDeviceControl_~ntStatus~2)))) (or (and .cse0 .cse1 (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|)) (and .cse0 .cse1 (= 0 ~PagingReferenceCount~0)))) [2018-12-01 18:38:52,394 INFO L448 ceAbstractionStarter]: For program point L6437(lines 6437 6476) no Hoare annotation was computed. [2018-12-01 18:38:52,394 INFO L444 ceAbstractionStarter]: At program point L6272(line 6272) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,394 INFO L444 ceAbstractionStarter]: At program point L6173(line 6173) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,394 INFO L448 ceAbstractionStarter]: For program point L5843(line 5843) no Hoare annotation was computed. [2018-12-01 18:38:52,394 INFO L444 ceAbstractionStarter]: At program point L5711loopEntry(lines 5711 5714) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,394 INFO L448 ceAbstractionStarter]: For program point L5777(lines 5777 5806) no Hoare annotation was computed. [2018-12-01 18:38:52,394 INFO L448 ceAbstractionStarter]: For program point L5744(lines 5744 5749) no Hoare annotation was computed. [2018-12-01 18:38:52,394 INFO L444 ceAbstractionStarter]: At program point L5447(lines 5446 6425) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,394 INFO L448 ceAbstractionStarter]: For program point L6438(lines 6438 6466) no Hoare annotation was computed. [2018-12-01 18:38:52,394 INFO L444 ceAbstractionStarter]: At program point L6372(lines 5476 6415) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,394 INFO L444 ceAbstractionStarter]: At program point L6108-1(line 6108) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,394 INFO L444 ceAbstractionStarter]: At program point L6108(line 6108) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,407 INFO L444 ceAbstractionStarter]: At program point L6009(lines 6004 6010) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L5316-1(line 5316) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L444 ceAbstractionStarter]: At program point L5316(line 5316) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L6109(line 6109) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L444 ceAbstractionStarter]: At program point L5812(lines 5452 6423) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,408 INFO L444 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 4706 6486) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L5449(lines 5449 6424) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L6044(lines 6044 6314) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L5912-2(lines 5912 5930) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L5945(lines 5945 5949) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L5912(lines 5912 5930) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L5945-1(lines 5945 5949) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L5582(lines 5582 5599) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L6441(lines 6441 6465) no Hoare annotation was computed. [2018-12-01 18:38:52,408 INFO L444 ceAbstractionStarter]: At program point L5715(lines 5710 5716) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,408 INFO L444 ceAbstractionStarter]: At program point L5649(line 5649) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,408 INFO L444 ceAbstractionStarter]: At program point L5649-1(line 5649) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,408 INFO L448 ceAbstractionStarter]: For program point L6343(lines 6343 6355) no Hoare annotation was computed. [2018-12-01 18:38:52,423 INFO L448 ceAbstractionStarter]: For program point L6409-1(line 6409) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L444 ceAbstractionStarter]: At program point L6409(line 6409) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 3 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,424 INFO L444 ceAbstractionStarter]: At program point L6046loopEntry(lines 6046 6049) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,424 INFO L444 ceAbstractionStarter]: At program point L5914loopEntry(lines 5914 5917) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (not (= 259 FloppyDeviceControl_~ntStatus~2)) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point L5650(line 5650) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point L5452(lines 5452 6423) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point L6377-1(lines 6373 6379) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L444 ceAbstractionStarter]: At program point L6377(line 6377) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point ExReleaseFastMutexFINAL(lines 20923 20929) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L451 ceAbstractionStarter]: At program point ExReleaseFastMutexENTRY(lines 20923 20929) the Hoare annotation is: true [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point ExReleaseFastMutexEXIT(lines 20923 20929) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0)) [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 9 14) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L451 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 9 14) the Hoare annotation is: true [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 9 14) no Hoare annotation was computed. [2018-12-01 18:38:52,424 INFO L444 ceAbstractionStarter]: At program point L20210(line 20210) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,424 INFO L448 ceAbstractionStarter]: For program point L20156(line 20156) no Hoare annotation was computed. [2018-12-01 18:38:52,425 INFO L448 ceAbstractionStarter]: For program point L20210-1(lines 20206 20212) no Hoare annotation was computed. [2018-12-01 18:38:52,425 INFO L448 ceAbstractionStarter]: For program point L20206(lines 20206 20212) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L444 ceAbstractionStarter]: At program point L20107(line 20107) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 20027 20234) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20104(lines 20104 20111) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L444 ceAbstractionStarter]: At program point L20104-1(lines 20104 20111) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,434 INFO L444 ceAbstractionStarter]: At program point L20162(line 20162) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (= 0 ~pended~0) (= 2 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20129-1(lines 20129 20229) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20129(lines 20129 20229) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20162-1(line 20162) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20138-1(line 20138) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20101-1(line 20101) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L444 ceAbstractionStarter]: At program point L20101(line 20101) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20113(line 20113) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 20027 20234) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20142(lines 20142 20173) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L444 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 20027 20234) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,434 INFO L444 ceAbstractionStarter]: At program point L20138(line 20138) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20122-1(line 20122) no Hoare annotation was computed. [2018-12-01 18:38:52,434 INFO L448 ceAbstractionStarter]: For program point L20225-1(line 20225) no Hoare annotation was computed. [2018-12-01 18:38:52,435 INFO L444 ceAbstractionStarter]: At program point L20225(line 20225) the Hoare annotation is: (or (and (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,435 INFO L448 ceAbstractionStarter]: For program point L20159(lines 20159 20166) no Hoare annotation was computed. [2018-12-01 18:38:52,441 INFO L444 ceAbstractionStarter]: At program point L20159-2(lines 20159 20166) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (= 0 ~pended~0) (= 2 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,441 INFO L444 ceAbstractionStarter]: At program point L20122(line 20122) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,441 INFO L444 ceAbstractionStarter]: At program point L20155-1(line 20155) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (= 0 ~pended~0) (= 2 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,441 INFO L444 ceAbstractionStarter]: At program point L20155(line 20155) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,441 INFO L448 ceAbstractionStarter]: For program point L20168(line 20168) no Hoare annotation was computed. [2018-12-01 18:38:52,441 INFO L444 ceAbstractionStarter]: At program point L20176(lines 20129 20229) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-01 18:38:52,441 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 20933 20947) no Hoare annotation was computed. [2018-12-01 18:38:52,441 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 20933 20947) no Hoare annotation was computed. [2018-12-01 18:38:52,441 INFO L451 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 20933 20947) the Hoare annotation is: true [2018-12-01 18:38:52,441 INFO L451 ceAbstractionStarter]: At program point L20942(line 20942) the Hoare annotation is: true [2018-12-01 18:38:52,441 INFO L448 ceAbstractionStarter]: For program point L20942-1(line 20942) no Hoare annotation was computed. [2018-12-01 18:38:52,441 INFO L451 ceAbstractionStarter]: At program point L4096(lines 4095 4139) the Hoare annotation is: true [2018-12-01 18:38:52,442 INFO L448 ceAbstractionStarter]: For program point L4082(lines 4082 4086) no Hoare annotation was computed. [2018-12-01 18:38:52,442 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 3936 4279) no Hoare annotation was computed. [2018-12-01 18:38:52,442 INFO L451 ceAbstractionStarter]: At program point L4111(lines 4110 4134) the Hoare annotation is: true [2018-12-01 18:38:52,442 INFO L448 ceAbstractionStarter]: For program point L4107(lines 4107 4135) no Hoare annotation was computed. [2018-12-01 18:38:52,442 INFO L451 ceAbstractionStarter]: At program point L4105(lines 4104 4136) the Hoare annotation is: true [2018-12-01 18:38:52,442 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 4112 4133) no Hoare annotation was computed. [2018-12-01 18:38:52,442 INFO L451 ceAbstractionStarter]: At program point L4132(lines 4112 4133) the Hoare annotation is: true [2018-12-01 18:38:52,442 INFO L448 ceAbstractionStarter]: For program point L4101(lines 4101 4137) no Hoare annotation was computed. [2018-12-01 18:38:52,442 INFO L448 ceAbstractionStarter]: For program point $Ultimate##13(lines 4112 4133) no Hoare annotation was computed. [2018-12-01 18:38:52,442 INFO L451 ceAbstractionStarter]: At program point L4099(lines 4098 4138) the Hoare annotation is: true [2018-12-01 18:38:52,447 INFO L448 ceAbstractionStarter]: For program point L4095(lines 4095 4139) no Hoare annotation was computed. [2018-12-01 18:38:52,447 INFO L451 ceAbstractionStarter]: At program point L4108(lines 4107 4135) the Hoare annotation is: true [2018-12-01 18:38:52,447 INFO L448 ceAbstractionStarter]: For program point L4104(lines 4104 4136) no Hoare annotation was computed. [2018-12-01 18:38:52,447 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 3936 4279) the Hoare annotation is: true [2018-12-01 18:38:52,447 INFO L451 ceAbstractionStarter]: At program point L4102(lines 4101 4137) the Hoare annotation is: true [2018-12-01 18:38:52,447 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 3936 4279) no Hoare annotation was computed. [2018-12-01 18:38:52,448 INFO L448 ceAbstractionStarter]: For program point L4098(lines 4098 4138) no Hoare annotation was computed. [2018-12-01 18:38:52,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,448 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~s~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0)) [2018-12-01 18:38:52,448 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 18:38:52,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 18:38:52,448 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 22027 22047) the Hoare annotation is: true [2018-12-01 18:38:52,448 INFO L451 ceAbstractionStarter]: At program point L22035(lines 22034 22044) the Hoare annotation is: true [2018-12-01 18:38:52,448 INFO L448 ceAbstractionStarter]: For program point L22042(lines 22027 22047) no Hoare annotation was computed. [2018-12-01 18:38:52,448 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 22027 22047) no Hoare annotation was computed. [2018-12-01 18:38:52,448 INFO L448 ceAbstractionStarter]: For program point L22031(lines 22031 22045) no Hoare annotation was computed. [2018-12-01 18:38:52,448 INFO L451 ceAbstractionStarter]: At program point L22032(lines 22031 22045) the Hoare annotation is: true [2018-12-01 18:38:52,448 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 22036 22043) no Hoare annotation was computed. [2018-12-01 18:38:52,448 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 22036 22043) no Hoare annotation was computed. [2018-12-01 18:38:52,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 06:38:52 BoogieIcfgContainer [2018-12-01 18:38:52,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 18:38:52,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 18:38:52,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 18:38:52,502 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 18:38:52,503 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:35:16" (3/4) ... [2018-12-01 18:38:52,507 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 18:38:52,514 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoGetConfigurationInformation [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedInsertTailList [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlInitUnicodeString [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoStartNextPowerIrp [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExFreePool [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DriverEntry [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetHardErrorOrVerifyDevice [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDetachDevice [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-12-01 18:38:52,515 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure MmResetDriverPaging [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyReadWrite [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObfDereferenceObject [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeInitializeEvent [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedRemoveHeadList [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPower [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlFreeUnicodeString [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeReleaseSemaphore [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyUnload [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedExchange [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure MmPageEntireDriver [2018-12-01 18:38:52,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlDeleteRegistryValue [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteDevice [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAcquireFastMutex [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlQueryRegistryValues [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExReleaseFastMutex [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_guard [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-12-01 18:38:52,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-12-01 18:38:52,518 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-01 18:38:52,562 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 646 nodes and edges [2018-12-01 18:38:52,568 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 313 nodes and edges [2018-12-01 18:38:52,573 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 147 nodes and edges [2018-12-01 18:38:52,578 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2018-12-01 18:38:52,582 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-12-01 18:38:52,586 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-01 18:38:52,588 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-01 18:38:52,590 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-01 18:38:52,592 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 18:38:52,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 == s && __cil_tmp14 == 1) && !(259 == status)) || (((((0 == pended && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((status == lowerDriverReturn && 0 == pended && 0 == compRegistered) && s == 4)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((__cil_tmp14 == 1 && pended == 1) && 0 == customIrp) && 0 == compRegistered && s == 4)) || 0 == s) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || (status == lowerDriverReturn && (((0 == pended && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 == s && __cil_tmp14 == 1) && !(259 == status)) || (((((0 == pended && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || ((((((0 == compRegistered && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((0 == pended && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && pended == 1) && 0 == customIrp)) || !(\old(PagingReferenceCount) == 0)) || (status == lowerDriverReturn && ((((0 == compRegistered && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((0 == pended && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)))) || ((status == lowerDriverReturn && 0 == pended && 0 == compRegistered) && s == 4)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || 0 == s) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 == s && __cil_tmp14 == 1) && !(259 == status)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (((((((0 == compRegistered && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((((0 == pended && !(6 == s)) && !(0 == compRegistered)) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && !(259 == status)) && 0 == PagingReferenceCount)) || (((((0 == pended && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && pended == 1) && 0 == customIrp)) || ((status == lowerDriverReturn && 0 == pended && 0 == compRegistered) && s == 4)) || (status == lowerDriverReturn && (((((0 == compRegistered && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((((0 == pended && !(6 == s)) && !(0 == compRegistered)) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && !(259 == status)) && 0 == PagingReferenceCount)) || (((((0 == pended && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)))) || ((0 == compRegistered && 2 == s) && !(259 == status))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,615 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) || (1 == s && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) && ((((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)))) && (((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled))) && (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) || (customIrp == \old(customIrp) && 1 == s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (0 == customIrp && 1 == s)) || !(\old(customIrp) == 0)) [2018-12-01 18:38:52,615 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) || (1 == s && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) && ((((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)))) && (((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled))) && (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) || (customIrp == \old(customIrp) && 1 == s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (0 == customIrp && 1 == s)) || !(\old(customIrp) == 0)) [2018-12-01 18:38:52,615 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s)) [2018-12-01 18:38:52,615 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-12-01 18:38:52,615 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) [2018-12-01 18:38:52,615 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == pended && 2 == s) && PagingReferenceCount == 1) && !(259 == ntStatus)) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == compRegistered && pended == 1) && 0 == customIrp) && !(PagingReferenceCount % 4294967296 == 0)) && s == 4)) || (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && 2 == s)) || ((((0 == pended && 6 == s) && !(0 == compRegistered)) && 1 == setEventCalled) && PagingReferenceCount == 1)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && PagingReferenceCount == 1) && s == 4)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && 0 == customIrp) && s == 4)) || (((0 == compRegistered && !(ntStatus == 259)) && 2 == s) && !(PagingReferenceCount % 4294967296 == 0)) [2018-12-01 18:38:52,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s)) [2018-12-01 18:38:52,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s)) [2018-12-01 18:38:52,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s)) [2018-12-01 18:38:52,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || 3 == s) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) && ((((!(compRegistered == 0) || !(0 == pended)) || !(PagingReferenceCount == 0)) || 3 == s) || !(3 == \old(s)))) && ((((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && returnVal2 == 259) && s == 5) || ((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || (((0 == __cil_tmp9 + 1073741802 && returnVal2 + 1073741823 <= 0) && 1 == setEventCalled) && s == 5)) || (((0 == __cil_tmp9 + 1073741802 && 0 == returnVal2) && 1 == setEventCalled) && s == 5))) && ((((s == \old(s) || !(PagingReferenceCount == 1)) || !(compRegistered == 0)) || !(0 == pended)) || !(3 == \old(s)))) && ((3 == s || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) [2018-12-01 18:38:52,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-12-01 18:38:52,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-12-01 18:38:52,616 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || 0 == myStatus) || !(\old(customIrp) == 0)) && ((((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || ((((0 == pended && customIrp == \old(customIrp)) && !(0 == compRegistered)) && s == \old(s)) && PagingReferenceCount == 1))) && ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || (((0 == pended && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1)) || !(1 == \old(s)))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s))) [2018-12-01 18:38:52,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == myStatus || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || !(\old(customIrp) == 0)) && ((((((((0 == pended && customIrp == \old(customIrp)) && __cil_tmp17 == 0) && headOfList == 0) && !(0 == compRegistered)) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1) || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s)))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s)))) && ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((((((0 == pended && 0 == compRegistered) && __cil_tmp17 == 0) && headOfList == 0) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1)) || !(1 == \old(s))) [2018-12-01 18:38:52,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == pended && 0 == compRegistered) && 1 == s) && __cil_tmp14 == 1) && 0 < status + 1) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,618 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,618 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 == pended && 0 == compRegistered) && status == 0) && __cil_tmp14 == 1) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,618 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == pended && 0 == compRegistered) && 1 == s) && __cil_tmp14 == 1) && 0 < status + 1) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,620 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s)) && (((((0 == pended && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == s)) [2018-12-01 18:38:52,620 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(PagingReferenceCount) == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && PagingReferenceCount == 1)) || !(customIrp == 0)) || !(1 == s)) && (((((0 == pended && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == s)) [2018-12-01 18:38:52,620 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 == s && __cil_tmp14 == 1) && !(259 == status)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((status == lowerDriverReturn && 0 == pended && 0 == compRegistered) && s == 4)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((__cil_tmp14 == 1 && pended == 1) && 0 == customIrp) && 0 == compRegistered && s == 4)) || (((((0 == pended && !(0 == compRegistered)) && 6 == s) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || (status == lowerDriverReturn && (((0 == pended && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,620 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s)) && (((((0 == pended && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == s)) [2018-12-01 18:38:52,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(PagingReferenceCount) == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && PagingReferenceCount == 1)) || !(customIrp == 0)) || !(1 == s)) && (((((0 == pended && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == s)) [2018-12-01 18:38:52,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,623 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) [2018-12-01 18:38:52,623 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) [2018-12-01 18:38:52,623 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == s && PagingReferenceCount == 1) || (1 == s && 0 == PagingReferenceCount)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) && ((((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)))) && (((1 == s && 0 == customIrp) || (!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || !(\old(customIrp) == 0))) && (((((!(1 == pended) || (s == \old(s) && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0)) && (((customIrp == \old(customIrp) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) [2018-12-01 18:38:52,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == s && PagingReferenceCount == 1) || (1 == s && 0 == PagingReferenceCount)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == s && PagingReferenceCount == 1) || (1 == s && 0 == PagingReferenceCount)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) && !(ntStatus == 259)) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (0 == InterfaceType && ((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ntStatus == 259) && ((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,628 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,629 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: s == \old(s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,631 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: s == \old(s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) [2018-12-01 18:38:52,631 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,631 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,631 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,631 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-01 18:38:52,631 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) [2018-12-01 18:38:52,631 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,631 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || (s == \old(s) && 0 == customIrp) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || (s == \old(s) && 0 == customIrp) [2018-12-01 18:38:52,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) && ntStatus <= 0) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,633 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,633 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,633 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,633 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,633 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,633 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,634 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,634 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,636 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,636 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,640 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) [2018-12-01 18:38:52,640 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) [2018-12-01 18:38:52,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) [2018-12-01 18:38:52,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) [2018-12-01 18:38:52,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) [2018-12-01 18:38:52,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) [2018-12-01 18:38:52,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) [2018-12-01 18:38:52,822 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f1e6b754-915d-40bc-97f0-afd2594366ab/bin-2019/uautomizer/witness.graphml [2018-12-01 18:38:52,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 18:38:52,822 INFO L168 Benchmark]: Toolchain (without parser) took 230084.96 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 933.4 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-01 18:38:52,823 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:38:52,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2074.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 933.4 MB in the beginning and 1.2 GB in the end (delta: -266.8 MB). Peak memory consumption was 345.7 MB. Max. memory is 11.5 GB. [2018-12-01 18:38:52,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.36 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-01 18:38:52,823 INFO L168 Benchmark]: Boogie Preprocessor took 112.40 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-12-01 18:38:52,823 INFO L168 Benchmark]: RCFGBuilder took 11737.48 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 235.9 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -241.4 MB). Peak memory consumption was 632.1 MB. Max. memory is 11.5 GB. [2018-12-01 18:38:52,823 INFO L168 Benchmark]: TraceAbstraction took 215762.50 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.1 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-12-01 18:38:52,824 INFO L168 Benchmark]: Witness Printer took 319.67 ms. Allocated memory is still 4.7 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 205.9 MB). Peak memory consumption was 205.9 MB. Max. memory is 11.5 GB. [2018-12-01 18:38:52,825 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2074.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 933.4 MB in the beginning and 1.2 GB in the end (delta: -266.8 MB). Peak memory consumption was 345.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.36 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.40 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 11737.48 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 235.9 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -241.4 MB). Peak memory consumption was 632.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 215762.50 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.1 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 319.67 ms. Allocated memory is still 4.7 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 205.9 MB). Peak memory consumption was 205.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4282]: 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: 20837]: Loop Invariant Derived loop invariant: ((((((((((((((2 == s && __cil_tmp14 == 1) && !(259 == status)) || (((((0 == pended && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || ((((((0 == compRegistered && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((0 == pended && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && pended == 1) && 0 == customIrp)) || !(\old(PagingReferenceCount) == 0)) || (status == lowerDriverReturn && ((((0 == compRegistered && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((0 == pended && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)))) || ((status == lowerDriverReturn && 0 == pended && 0 == compRegistered) && s == 4)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || 0 == s) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || !(\old(customIrp) == 0) - InvariantResult [Line: 7202]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 5467]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6331]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5858]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21130]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7015]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 5569]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21230]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6004]: Loop Invariant Derived loop invariant: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21385]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4095]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19284]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8618]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 19717]: Loop Invariant Derived loop invariant: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || (s == \old(s) && 0 == customIrp) - InvariantResult [Line: 4475]: Loop Invariant Derived loop invariant: (((((!(\old(PagingReferenceCount) == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && PagingReferenceCount == 1)) || !(customIrp == 0)) || !(1 == s)) && (((((0 == pended && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == s)) - InvariantResult [Line: 6999]: Loop Invariant Derived loop invariant: (((((((((0 == pended && 2 == s) && PagingReferenceCount == 1) && !(259 == ntStatus)) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == compRegistered && pended == 1) && 0 == customIrp) && !(PagingReferenceCount % 4294967296 == 0)) && s == 4)) || (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && 2 == s)) || ((((0 == pended && 6 == s) && !(0 == compRegistered)) && 1 == setEventCalled) && PagingReferenceCount == 1)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && PagingReferenceCount == 1) && s == 4)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && 0 == customIrp) && s == 4)) || (((0 == compRegistered && !(ntStatus == 259)) && 2 == s) && !(PagingReferenceCount % 4294967296 == 0)) - InvariantResult [Line: 20774]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6913]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) - InvariantResult [Line: 8470]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8123]: Loop Invariant Derived loop invariant: (((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21382]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7023]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 21233]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20540]: Loop Invariant Derived loop invariant: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) - InvariantResult [Line: 6345]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21797]: Loop Invariant Derived loop invariant: (((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s)) - InvariantResult [Line: 20546]: Loop Invariant Derived loop invariant: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) - InvariantResult [Line: 20829]: Loop Invariant Derived loop invariant: ((((((((((((((2 == s && __cil_tmp14 == 1) && !(259 == status)) || (((((0 == pended && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((status == lowerDriverReturn && 0 == pended && 0 == compRegistered) && s == 4)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((__cil_tmp14 == 1 && pended == 1) && 0 == customIrp) && 0 == compRegistered && s == 4)) || 0 == s) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || (status == lowerDriverReturn && (((0 == pended && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) || !(\old(customIrp) == 0) - InvariantResult [Line: 8191]: Loop Invariant Derived loop invariant: (((((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) && !(ntStatus == 259)) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (0 == InterfaceType && ((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) - InvariantResult [Line: 5891]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21957]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8989]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 20549]: Loop Invariant Derived loop invariant: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) - InvariantResult [Line: 5836]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6997]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 8967]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5688]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5710]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5449]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21453]: Loop Invariant Derived loop invariant: (((((((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 21629]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) || (1 == s && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) && ((((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)))) && (((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled))) && (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) || (customIrp == \old(customIrp) && 1 == s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (0 == customIrp && 1 == s)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 5458]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 20449]: Loop Invariant Derived loop invariant: (((((0 == myStatus || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || !(\old(customIrp) == 0)) && ((((((((0 == pended && customIrp == \old(customIrp)) && __cil_tmp17 == 0) && headOfList == 0) && !(0 == compRegistered)) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1) || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s)))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s)))) && ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((((((0 == pended && 0 == compRegistered) && __cil_tmp17 == 0) && headOfList == 0) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1)) || !(1 == \old(s))) - InvariantResult [Line: 19737]: Loop Invariant Derived loop invariant: s == \old(s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 6357]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 7418]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 2645]: Loop Invariant Derived loop invariant: (((((0 == ntStatus || !(myStatus == 0)) || !(0 == s)) || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(customIrp == 0) - InvariantResult [Line: 5294]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8878]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 4684]: Loop Invariant Derived loop invariant: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) - InvariantResult [Line: 8605]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21954]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4104]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6976]: Loop Invariant Derived loop invariant: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21794]: Loop Invariant Derived loop invariant: (((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s)) - InvariantResult [Line: 5455]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 4098]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7944]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) - InvariantResult [Line: 5464]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 2779]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5487]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21632]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) || (1 == s && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) && ((((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)))) && (((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled))) && (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) || (customIrp == \old(customIrp) && 1 == s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (0 == customIrp && 1 == s)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 9011]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9033]: Loop Invariant Derived loop invariant: (((((1 == s && PagingReferenceCount == 1) || (1 == s && 0 == PagingReferenceCount)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8555]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8824]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21791]: Loop Invariant Derived loop invariant: (((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s)) - InvariantResult [Line: 5452]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21456]: Loop Invariant Derived loop invariant: (((((((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 6999]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 4101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6330]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 4449]: Loop Invariant Derived loop invariant: ((((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s)) && (((((0 == pended && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == s)) - InvariantResult [Line: 20450]: Loop Invariant Derived loop invariant: ((((((((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || 0 == myStatus) || !(\old(customIrp) == 0)) && ((((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || ((((0 == pended && customIrp == \old(customIrp)) && !(0 == compRegistered)) && s == \old(s)) && PagingReferenceCount == 1))) && ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || (((0 == pended && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1)) || !(1 == \old(s)))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s))) - InvariantResult [Line: 6046]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8617]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 20759]: Loop Invariant Derived loop invariant: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 19718]: Loop Invariant Derived loop invariant: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || (s == \old(s) && 0 == customIrp) - InvariantResult [Line: 8944]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 19283]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6344]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5914]: Loop Invariant Derived loop invariant: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 22009]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5859]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 22031]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21459]: Loop Invariant Derived loop invariant: (((((((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 6005]: Loop Invariant Derived loop invariant: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 22012]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5473]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5470]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 7975]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) - InvariantResult [Line: 5939]: Loop Invariant Derived loop invariant: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5890]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6912]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) - InvariantResult [Line: 8512]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 22034]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6979]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 5835]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21323]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7013]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 4477]: Loop Invariant Derived loop invariant: (((((!(\old(PagingReferenceCount) == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && PagingReferenceCount == 1)) || !(customIrp == 0)) || !(1 == s)) && (((((0 == pended && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == s)) - InvariantResult [Line: 4107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8220]: Loop Invariant Derived loop invariant: ((((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) && ntStatus <= 0) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5440]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 20762]: Loop Invariant Derived loop invariant: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 21351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4110]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20851]: Loop Invariant Derived loop invariant: (((((((((((2 == s && __cil_tmp14 == 1) && !(259 == status)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (((((((0 == compRegistered && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((((0 == pended && !(6 == s)) && !(0 == compRegistered)) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && !(259 == status)) && 0 == PagingReferenceCount)) || (((((0 == pended && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && pended == 1) && 0 == customIrp)) || ((status == lowerDriverReturn && 0 == pended && 0 == compRegistered) && s == 4)) || (status == lowerDriverReturn && (((((0 == compRegistered && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((((0 == pended && !(6 == s)) && !(0 == compRegistered)) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && !(259 == status)) && 0 == PagingReferenceCount)) || (((((0 == pended && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)))) || ((0 == compRegistered && 2 == s) && !(259 == status))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0) - InvariantResult [Line: 8958]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 4683]: Loop Invariant Derived loop invariant: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) - InvariantResult [Line: 19738]: Loop Invariant Derived loop invariant: s == \old(s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 20768]: Loop Invariant Derived loop invariant: (((((((((((0 == pended && 0 == compRegistered) && status == 0) && __cil_tmp14 == 1) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 5293]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8604]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5443]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5689]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6994]: Loop Invariant Derived loop invariant: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5711]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5292]: Loop Invariant Derived loop invariant: (((((1 == s && PagingReferenceCount == 1) || (1 == s && 0 == PagingReferenceCount)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 20450]: Loop Invariant Derived loop invariant: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) - InvariantResult [Line: 8990]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21771]: Loop Invariant Derived loop invariant: (((3 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(3 == \old(s)) - InvariantResult [Line: 8516]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9010]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6358]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21326]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21607]: Loop Invariant Derived loop invariant: (((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) && ((((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)))) && (((1 == s && 0 == customIrp) || (!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || !(\old(customIrp) == 0))) && (((((!(1 == pended) || (s == \old(s) && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0)) && (((customIrp == \old(customIrp) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) - InvariantResult [Line: 9032]: Loop Invariant Derived loop invariant: (((((1 == s && PagingReferenceCount == 1) || (1 == s && 0 == PagingReferenceCount)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8509]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8927]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8112]: Loop Invariant Derived loop invariant: (!(ntStatus == 259) && ((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20765]: Loop Invariant Derived loop invariant: (((((((((0 == pended && 0 == compRegistered) && 1 == s) && __cil_tmp14 == 1) && 0 < status + 1) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 2646]: Loop Invariant Derived loop invariant: (((((0 == ntStatus || !(myStatus == 0)) || !(0 == s)) || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(customIrp == 0) - InvariantResult [Line: 8673]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21738]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7204]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 20129]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21354]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20726]: Loop Invariant Derived loop invariant: (((((((((((((2 == s && __cil_tmp14 == 1) && !(259 == status)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((status == lowerDriverReturn && 0 == pended && 0 == compRegistered) && s == 4)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((__cil_tmp14 == 1 && pended == 1) && 0 == customIrp) && 0 == compRegistered && s == 4)) || (((((0 == pended && !(0 == compRegistered)) && 6 == s) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || (status == lowerDriverReturn && (((0 == pended && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) || !(\old(customIrp) == 0) - InvariantResult [Line: 5486]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6991]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 5446]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 7944]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) - InvariantResult [Line: 7962]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) - InvariantResult [Line: 8471]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 4447]: Loop Invariant Derived loop invariant: ((((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s)) && (((((0 == pended && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == s)) - InvariantResult [Line: 8823]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 20771]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && 0 == compRegistered) && 1 == s) && __cil_tmp14 == 1) && 0 < status + 1) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 5476]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6045]: Loop Invariant Derived loop invariant: (((((0 == pended && 1 == s) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 7212]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 21433]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || 3 == s) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) && ((((!(compRegistered == 0) || !(0 == pended)) || !(PagingReferenceCount == 0)) || 3 == s) || !(3 == \old(s)))) && ((((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && returnVal2 == 259) && s == 5) || ((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || (((0 == __cil_tmp9 + 1073741802 && returnVal2 + 1073741823 <= 0) && 1 == setEventCalled) && s == 5)) || (((0 == __cil_tmp9 + 1073741802 && 0 == returnVal2) && 1 == setEventCalled) && s == 5))) && ((((s == \old(s) || !(PagingReferenceCount == 1)) || !(compRegistered == 0)) || !(0 == pended)) || !(3 == \old(s)))) && ((3 == s || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) - InvariantResult [Line: 21735]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7474]: Loop Invariant Derived loop invariant: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8557]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8506]: Loop Invariant Derived loop invariant: (((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6985]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 2780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21863]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5913]: Loop Invariant Derived loop invariant: ((((((0 == pended && 1 == s) && !(259 == ntStatus)) && 0 == PagingReferenceCount) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(1 == \old(s)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 64 procedures, 981 locations, 1 error locations. SAFE Result, 215.6s OverallTime, 62 OverallIterations, 7 TraceHistogramMax, 155.7s AutomataDifference, 0.0s DeadEndRemovalTime, 33.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 69955 SDtfs, 22452 SDslu, 297206 SDs, 0 SdLazy, 23534 SolverSat, 4201 SolverUnsat, 55 SolverUnknown, 0 SolverNotchecked, 136.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1786 GetRequests, 1279 SyntacticMatches, 27 SemanticMatches, 480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83106occurred in iteration=40, 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: 12.6s AutomataMinimizationTime, 62 MinimizatonAttempts, 6120 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 422 LocationsWithAnnotation, 229060 PreInvPairs, 229775 NumberOfFragments, 13972 HoareAnnotationTreeSize, 229060 FomulaSimplifications, 97709 FormulaSimplificationTreeSizeReduction, 8.6s HoareSimplificationTime, 422 FomulaSimplificationsInter, 95955 FormulaSimplificationTreeSizeReductionInter, 23.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 9771 NumberOfCodeBlocks, 9771 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 9703 ConstructedInterpolants, 0 QuantifiedInterpolants, 2351196 SizeOfPredicates, 34 NumberOfNonLiveVariables, 22802 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 68 InterpolantComputations, 60 PerfectInterpolantSequences, 1193/1233 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...