./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/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_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/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 f258c90f36976c16d0d11e6e43c3b54011814f65 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:32:02,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:32:02,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:32:02,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:32:02,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:32:02,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:32:02,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:32:02,981 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:32:02,982 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:32:02,983 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:32:02,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:32:02,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:32:02,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:32:02,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:32:02,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:32:02,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:32:02,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:32:02,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:32:02,989 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:32:02,990 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:32:02,991 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:32:02,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:32:02,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:32:02,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:32:02,993 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:32:02,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:32:02,994 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:32:02,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:32:02,995 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:32:02,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:32:02,996 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:32:02,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:32:02,996 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:32:02,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:32:02,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:32:02,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:32:02,997 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 01:32:03,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:32:03,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:32:03,005 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:32:03,005 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:32:03,005 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:32:03,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:32:03,006 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:32:03,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:32:03,006 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:32:03,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:32:03,006 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:32:03,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:32:03,006 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:32:03,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:32:03,007 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:32:03,007 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:32:03,007 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:32:03,007 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:32:03,007 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:32:03,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:32:03,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:32:03,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:32:03,008 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:32:03,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:32:03,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:32:03,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:32:03,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:32:03,008 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:32:03,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:32:03,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:32:03,008 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_34edd432-ec7d-4c41-a042-90880cd6aca8/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 -> f258c90f36976c16d0d11e6e43c3b54011814f65 [2018-11-23 01:32:03,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:32:03,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:32:03,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:32:03,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:32:03,044 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:32:03,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-11-23 01:32:03,087 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/data/9c4180a2b/d12eb5a0ba8244db98309470cf1a9f13/FLAGef7dd2376 [2018-11-23 01:32:03,735 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:32:03,736 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-11-23 01:32:03,780 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/data/9c4180a2b/d12eb5a0ba8244db98309470cf1a9f13/FLAGef7dd2376 [2018-11-23 01:32:04,061 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/data/9c4180a2b/d12eb5a0ba8244db98309470cf1a9f13 [2018-11-23 01:32:04,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:32:04,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:32:04,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:32:04,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:32:04,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:32:04,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:04" (1/1) ... [2018-11-23 01:32:04,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f3cdb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:04, skipping insertion in model container [2018-11-23 01:32:04,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:04" (1/1) ... [2018-11-23 01:32:04,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:32:04,218 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:32:05,943 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:32:05,969 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:32:06,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:32:06,550 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:32:06,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06 WrapperNode [2018-11-23 01:32:06,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:32:06,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:32:06,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:32:06,551 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:32:06,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:32:06,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:32:06,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:32:06,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:32:06,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... [2018-11-23 01:32:06,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:32:06,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:32:06,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:32:06,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:32:06,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:32:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-11-23 01:32:06,866 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-11-23 01:32:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-11-23 01:32:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-11-23 01:32:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-23 01:32:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:32:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2018-11-23 01:32:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2018-11-23 01:32:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:32:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-23 01:32:06,868 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-23 01:32:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-23 01:32:06,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-23 01:32:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-23 01:32:06,869 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-23 01:32:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-23 01:32:06,869 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-23 01:32:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2018-11-23 01:32:06,869 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2018-11-23 01:32:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-23 01:32:06,869 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-23 01:32:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2018-11-23 01:32:06,869 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2018-11-23 01:32:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-23 01:32:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-23 01:32:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-23 01:32:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-23 01:32:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 01:32:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 01:32:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2018-11-23 01:32:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2018-11-23 01:32:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-23 01:32:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-23 01:32:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-23 01:32:06,871 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-23 01:32:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyReadWrite [2018-11-23 01:32:06,871 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyReadWrite [2018-11-23 01:32:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2018-11-23 01:32:06,871 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2018-11-23 01:32:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-23 01:32:06,871 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-23 01:32:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:32:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2018-11-23 01:32:06,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2018-11-23 01:32:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-23 01:32:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-23 01:32:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 01:32:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 01:32:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-11-23 01:32:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-11-23 01:32:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-11-23 01:32:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-11-23 01:32:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-23 01:32:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-23 01:32:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-23 01:32:06,873 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-23 01:32:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2018-11-23 01:32:06,873 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2018-11-23 01:32:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-11-23 01:32:06,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-11-23 01:32:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2018-11-23 01:32:06,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2018-11-23 01:32:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 01:32:06,873 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 01:32:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-23 01:32:06,873 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-23 01:32:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-23 01:32:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-23 01:32:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2018-11-23 01:32:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2018-11-23 01:32:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:32:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:32:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-23 01:32:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-23 01:32:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-23 01:32:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-23 01:32:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-23 01:32:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-23 01:32:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:32:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:32:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2018-11-23 01:32:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2018-11-23 01:32:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:32:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 01:32:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 01:32:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2018-11-23 01:32:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2018-11-23 01:32:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-23 01:32:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-23 01:32:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2018-11-23 01:32:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2018-11-23 01:32:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:32:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 01:32:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 01:32:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 01:32:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 01:32:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2018-11-23 01:32:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2018-11-23 01:32:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-23 01:32:06,877 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-23 01:32:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:32:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2018-11-23 01:32:06,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2018-11-23 01:32:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-23 01:32:06,877 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-23 01:32:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPower [2018-11-23 01:32:06,877 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPower [2018-11-23 01:32:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2018-11-23 01:32:06,877 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2018-11-23 01:32:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 01:32:06,878 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 01:32:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2018-11-23 01:32:06,878 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2018-11-23 01:32:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyUnload [2018-11-23 01:32:06,878 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyUnload [2018-11-23 01:32:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-23 01:32:06,878 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-23 01:32:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-11-23 01:32:06,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-11-23 01:32:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2018-11-23 01:32:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2018-11-23 01:32:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2018-11-23 01:32:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2018-11-23 01:32:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-11-23 01:32:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-11-23 01:32:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 01:32:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-11-23 01:32:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-11-23 01:32:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-23 01:32:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-23 01:32:06,880 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-23 01:32:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-23 01:32:06,880 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-23 01:32:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-23 01:32:06,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:32:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:32:07,462 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:07,463 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:07,601 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:07,602 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:08,448 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:08,448 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:08,526 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:08,526 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:09,005 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:09,005 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:09,012 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:09,012 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,184 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,184 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,192 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,192 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,201 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,201 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,210 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,210 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,285 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,285 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,304 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,304 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,446 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,446 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,509 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,509 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,523 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,523 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:11,529 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:11,529 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:12,267 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:12,267 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:14,955 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:14,955 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:17,062 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:32:17,062 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:32:17,084 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:32:17,085 INFO L280 CfgBuilder]: Removed 49 assue(true) statements. [2018-11-23 01:32:17,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:17 BoogieIcfgContainer [2018-11-23 01:32:17,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:32:17,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:32:17,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:32:17,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:32:17,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:32:04" (1/3) ... [2018-11-23 01:32:17,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b58b6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:32:17, skipping insertion in model container [2018-11-23 01:32:17,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:06" (2/3) ... [2018-11-23 01:32:17,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b58b6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:32:17, skipping insertion in model container [2018-11-23 01:32:17,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:17" (3/3) ... [2018-11-23 01:32:17,091 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy2_true-unreach-call_true-termination.i.cil.c [2018-11-23 01:32:17,098 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:32:17,105 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:32:17,118 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:32:17,147 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:32:17,148 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:32:17,148 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:32:17,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:32:17,148 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:32:17,148 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:32:17,148 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:32:17,148 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:32:17,148 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:32:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states. [2018-11-23 01:32:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 01:32:17,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:17,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:17,182 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:17,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash 370768153, now seen corresponding path program 1 times [2018-11-23 01:32:17,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:17,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:17,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:17,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:17,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:17,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:17,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:32:17,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:32:17,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:32:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:32:17,517 INFO L87 Difference]: Start difference. First operand 941 states. Second operand 2 states. [2018-11-23 01:32:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:17,601 INFO L93 Difference]: Finished difference Result 1871 states and 2873 transitions. [2018-11-23 01:32:17,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:32:17,603 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 43 [2018-11-23 01:32:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:17,616 INFO L225 Difference]: With dead ends: 1871 [2018-11-23 01:32:17,617 INFO L226 Difference]: Without dead ends: 934 [2018-11-23 01:32:17,622 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-11-23 01:32:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-11-23 01:32:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2018-11-23 01:32:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2018-11-23 01:32:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1281 transitions. [2018-11-23 01:32:17,701 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1281 transitions. Word has length 43 [2018-11-23 01:32:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:17,701 INFO L480 AbstractCegarLoop]: Abstraction has 934 states and 1281 transitions. [2018-11-23 01:32:17,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:32:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1281 transitions. [2018-11-23 01:32:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 01:32:17,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:17,704 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-11-23 01:32:17,704 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:17,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash 298381595, now seen corresponding path program 1 times [2018-11-23 01:32:17,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:17,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:17,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:17,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:17,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:17,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:17,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:17,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:17,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:17,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:17,923 INFO L87 Difference]: Start difference. First operand 934 states and 1281 transitions. Second operand 3 states. [2018-11-23 01:32:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:18,233 INFO L93 Difference]: Finished difference Result 970 states and 1318 transitions. [2018-11-23 01:32:18,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:18,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-23 01:32:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:18,239 INFO L225 Difference]: With dead ends: 970 [2018-11-23 01:32:18,239 INFO L226 Difference]: Without dead ends: 948 [2018-11-23 01:32:18,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2018-11-23 01:32:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2018-11-23 01:32:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-11-23 01:32:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1291 transitions. [2018-11-23 01:32:18,278 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1291 transitions. Word has length 43 [2018-11-23 01:32:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:18,278 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 1291 transitions. [2018-11-23 01:32:18,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1291 transitions. [2018-11-23 01:32:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 01:32:18,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:18,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] [2018-11-23 01:32:18,282 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:18,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:18,282 INFO L82 PathProgramCache]: Analyzing trace with hash -395736827, now seen corresponding path program 1 times [2018-11-23 01:32:18,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:18,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:18,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:18,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:18,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:18,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:18,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:18,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:18,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:18,451 INFO L87 Difference]: Start difference. First operand 948 states and 1291 transitions. Second operand 3 states. [2018-11-23 01:32:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:18,744 INFO L93 Difference]: Finished difference Result 2626 states and 3683 transitions. [2018-11-23 01:32:18,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:18,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-23 01:32:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:18,753 INFO L225 Difference]: With dead ends: 2626 [2018-11-23 01:32:18,753 INFO L226 Difference]: Without dead ends: 1717 [2018-11-23 01:32:18,757 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-11-23 01:32:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2018-11-23 01:32:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1715. [2018-11-23 01:32:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-11-23 01:32:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2365 transitions. [2018-11-23 01:32:18,822 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2365 transitions. Word has length 56 [2018-11-23 01:32:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:18,822 INFO L480 AbstractCegarLoop]: Abstraction has 1715 states and 2365 transitions. [2018-11-23 01:32:18,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2365 transitions. [2018-11-23 01:32:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 01:32:18,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:18,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:18,827 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:18,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash 907086763, now seen corresponding path program 1 times [2018-11-23 01:32:18,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:18,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:18,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:19,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:19,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:32:19,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:32:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:32:19,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:19,158 INFO L87 Difference]: Start difference. First operand 1715 states and 2365 transitions. Second operand 4 states. [2018-11-23 01:32:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:19,297 INFO L93 Difference]: Finished difference Result 3388 states and 4687 transitions. [2018-11-23 01:32:19,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:32:19,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-23 01:32:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:19,306 INFO L225 Difference]: With dead ends: 3388 [2018-11-23 01:32:19,306 INFO L226 Difference]: Without dead ends: 1743 [2018-11-23 01:32:19,311 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-11-23 01:32:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2018-11-23 01:32:19,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1725. [2018-11-23 01:32:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2018-11-23 01:32:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2375 transitions. [2018-11-23 01:32:19,370 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2375 transitions. Word has length 79 [2018-11-23 01:32:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:19,371 INFO L480 AbstractCegarLoop]: Abstraction has 1725 states and 2375 transitions. [2018-11-23 01:32:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:32:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2375 transitions. [2018-11-23 01:32:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 01:32:19,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:19,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:19,374 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:19,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:19,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1948764742, now seen corresponding path program 1 times [2018-11-23 01:32:19,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:19,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:19,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:19,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:19,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:19,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:19,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:32:19,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:32:19,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:32:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:19,631 INFO L87 Difference]: Start difference. First operand 1725 states and 2375 transitions. Second operand 4 states. [2018-11-23 01:32:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:19,748 INFO L93 Difference]: Finished difference Result 3398 states and 4697 transitions. [2018-11-23 01:32:19,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:32:19,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-23 01:32:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:19,757 INFO L225 Difference]: With dead ends: 3398 [2018-11-23 01:32:19,757 INFO L226 Difference]: Without dead ends: 1753 [2018-11-23 01:32:19,762 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-11-23 01:32:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2018-11-23 01:32:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1735. [2018-11-23 01:32:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-11-23 01:32:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2385 transitions. [2018-11-23 01:32:19,824 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2385 transitions. Word has length 80 [2018-11-23 01:32:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2385 transitions. [2018-11-23 01:32:19,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:32:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2385 transitions. [2018-11-23 01:32:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 01:32:19,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:19,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:19,827 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:19,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1109935510, now seen corresponding path program 1 times [2018-11-23 01:32:19,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:19,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:19,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:20,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:20,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:32:20,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:32:20,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:32:20,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:20,130 INFO L87 Difference]: Start difference. First operand 1735 states and 2385 transitions. Second operand 4 states. [2018-11-23 01:32:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:20,264 INFO L93 Difference]: Finished difference Result 3411 states and 4719 transitions. [2018-11-23 01:32:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:32:20,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-23 01:32:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:20,273 INFO L225 Difference]: With dead ends: 3411 [2018-11-23 01:32:20,273 INFO L226 Difference]: Without dead ends: 1766 [2018-11-23 01:32:20,279 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-11-23 01:32:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2018-11-23 01:32:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1745. [2018-11-23 01:32:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2018-11-23 01:32:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2402 transitions. [2018-11-23 01:32:20,336 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2402 transitions. Word has length 81 [2018-11-23 01:32:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:20,336 INFO L480 AbstractCegarLoop]: Abstraction has 1745 states and 2402 transitions. [2018-11-23 01:32:20,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:32:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2402 transitions. [2018-11-23 01:32:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:32:20,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:20,338 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-11-23 01:32:20,339 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:20,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:20,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2147297015, now seen corresponding path program 1 times [2018-11-23 01:32:20,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:20,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:20,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:20,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:20,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:20,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:20,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:20,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:20,494 INFO L87 Difference]: Start difference. First operand 1745 states and 2402 transitions. Second operand 3 states. [2018-11-23 01:32:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:20,711 INFO L93 Difference]: Finished difference Result 3464 states and 4849 transitions. [2018-11-23 01:32:20,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:20,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-11-23 01:32:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:20,719 INFO L225 Difference]: With dead ends: 3464 [2018-11-23 01:32:20,719 INFO L226 Difference]: Without dead ends: 1814 [2018-11-23 01:32:20,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2018-11-23 01:32:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1812. [2018-11-23 01:32:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1812 states. [2018-11-23 01:32:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2488 transitions. [2018-11-23 01:32:20,783 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2488 transitions. Word has length 78 [2018-11-23 01:32:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:20,783 INFO L480 AbstractCegarLoop]: Abstraction has 1812 states and 2488 transitions. [2018-11-23 01:32:20,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2488 transitions. [2018-11-23 01:32:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 01:32:20,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:20,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:20,785 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:20,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:20,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1451437060, now seen corresponding path program 1 times [2018-11-23 01:32:20,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:20,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:20,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:20,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:20,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:20,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:20,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:20,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:20,913 INFO L87 Difference]: Start difference. First operand 1812 states and 2488 transitions. Second operand 3 states. [2018-11-23 01:32:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:21,228 INFO L93 Difference]: Finished difference Result 4399 states and 6225 transitions. [2018-11-23 01:32:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:21,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-11-23 01:32:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:21,241 INFO L225 Difference]: With dead ends: 4399 [2018-11-23 01:32:21,241 INFO L226 Difference]: Without dead ends: 2683 [2018-11-23 01:32:21,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2018-11-23 01:32:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2680. [2018-11-23 01:32:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2018-11-23 01:32:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3721 transitions. [2018-11-23 01:32:21,336 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3721 transitions. Word has length 76 [2018-11-23 01:32:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:21,336 INFO L480 AbstractCegarLoop]: Abstraction has 2680 states and 3721 transitions. [2018-11-23 01:32:21,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3721 transitions. [2018-11-23 01:32:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 01:32:21,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:21,338 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-11-23 01:32:21,338 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:21,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:21,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1700120423, now seen corresponding path program 1 times [2018-11-23 01:32:21,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:21,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:21,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:21,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:32:21,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:32:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:32:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:21,721 INFO L87 Difference]: Start difference. First operand 2680 states and 3721 transitions. Second operand 4 states. [2018-11-23 01:32:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:21,852 INFO L93 Difference]: Finished difference Result 3345 states and 4593 transitions. [2018-11-23 01:32:21,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:32:21,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-23 01:32:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:21,865 INFO L225 Difference]: With dead ends: 3345 [2018-11-23 01:32:21,865 INFO L226 Difference]: Without dead ends: 2727 [2018-11-23 01:32:21,869 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-11-23 01:32:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2018-11-23 01:32:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2696. [2018-11-23 01:32:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-23 01:32:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3752 transitions. [2018-11-23 01:32:21,974 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3752 transitions. Word has length 82 [2018-11-23 01:32:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:21,974 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 3752 transitions. [2018-11-23 01:32:21,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:32:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3752 transitions. [2018-11-23 01:32:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 01:32:21,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:21,977 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, 1, 1] [2018-11-23 01:32:21,977 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:21,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash -836779387, now seen corresponding path program 1 times [2018-11-23 01:32:21,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:21,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:21,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:21,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 01:32:22,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:22,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:32:22,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:32:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:32:22,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:22,151 INFO L87 Difference]: Start difference. First operand 2696 states and 3752 transitions. Second operand 4 states. [2018-11-23 01:32:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:22,313 INFO L93 Difference]: Finished difference Result 5328 states and 7436 transitions. [2018-11-23 01:32:22,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:32:22,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-23 01:32:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:22,328 INFO L225 Difference]: With dead ends: 5328 [2018-11-23 01:32:22,328 INFO L226 Difference]: Without dead ends: 2738 [2018-11-23 01:32:22,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2018-11-23 01:32:22,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2707. [2018-11-23 01:32:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2707 states. [2018-11-23 01:32:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2707 states and 3766 transitions. [2018-11-23 01:32:22,442 INFO L78 Accepts]: Start accepts. Automaton has 2707 states and 3766 transitions. Word has length 84 [2018-11-23 01:32:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:22,442 INFO L480 AbstractCegarLoop]: Abstraction has 2707 states and 3766 transitions. [2018-11-23 01:32:22,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:32:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 3766 transitions. [2018-11-23 01:32:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 01:32:22,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:22,444 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-11-23 01:32:22,445 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:22,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash -594268106, now seen corresponding path program 1 times [2018-11-23 01:32:22,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:22,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 01:32:22,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:22,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:22,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:22,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:22,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:22,629 INFO L87 Difference]: Start difference. First operand 2707 states and 3766 transitions. Second operand 3 states. [2018-11-23 01:32:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:22,838 INFO L93 Difference]: Finished difference Result 7846 states and 11189 transitions. [2018-11-23 01:32:22,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:22,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-11-23 01:32:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:22,866 INFO L225 Difference]: With dead ends: 7846 [2018-11-23 01:32:22,866 INFO L226 Difference]: Without dead ends: 5246 [2018-11-23 01:32:22,879 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-11-23 01:32:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2018-11-23 01:32:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 5244. [2018-11-23 01:32:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2018-11-23 01:32:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 7430 transitions. [2018-11-23 01:32:23,079 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 7430 transitions. Word has length 82 [2018-11-23 01:32:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:23,079 INFO L480 AbstractCegarLoop]: Abstraction has 5244 states and 7430 transitions. [2018-11-23 01:32:23,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 7430 transitions. [2018-11-23 01:32:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 01:32:23,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:23,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:23,082 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:23,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:23,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1909320555, now seen corresponding path program 1 times [2018-11-23 01:32:23,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:23,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:23,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:23,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:23,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:23,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:23,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:23,380 INFO L87 Difference]: Start difference. First operand 5244 states and 7430 transitions. Second operand 3 states. [2018-11-23 01:32:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:23,654 INFO L93 Difference]: Finished difference Result 15306 states and 22820 transitions. [2018-11-23 01:32:23,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:23,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-11-23 01:32:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:23,700 INFO L225 Difference]: With dead ends: 15306 [2018-11-23 01:32:23,700 INFO L226 Difference]: Without dead ends: 10169 [2018-11-23 01:32:23,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10169 states. [2018-11-23 01:32:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10169 to 10158. [2018-11-23 01:32:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10158 states. [2018-11-23 01:32:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10158 states to 10158 states and 14945 transitions. [2018-11-23 01:32:24,020 INFO L78 Accepts]: Start accepts. Automaton has 10158 states and 14945 transitions. Word has length 95 [2018-11-23 01:32:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:24,020 INFO L480 AbstractCegarLoop]: Abstraction has 10158 states and 14945 transitions. [2018-11-23 01:32:24,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10158 states and 14945 transitions. [2018-11-23 01:32:24,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 01:32:24,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:24,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] [2018-11-23 01:32:24,022 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:24,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1050755451, now seen corresponding path program 1 times [2018-11-23 01:32:24,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:24,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:24,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:24,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:24,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:24,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:32:24,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:32:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:32:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:24,128 INFO L87 Difference]: Start difference. First operand 10158 states and 14945 transitions. Second operand 4 states. [2018-11-23 01:32:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:24,319 INFO L93 Difference]: Finished difference Result 10238 states and 15036 transitions. [2018-11-23 01:32:24,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:32:24,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-23 01:32:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:24,350 INFO L225 Difference]: With dead ends: 10238 [2018-11-23 01:32:24,350 INFO L226 Difference]: Without dead ends: 10197 [2018-11-23 01:32:24,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10197 states. [2018-11-23 01:32:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10197 to 10154. [2018-11-23 01:32:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10154 states. [2018-11-23 01:32:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10154 states to 10154 states and 14939 transitions. [2018-11-23 01:32:24,856 INFO L78 Accepts]: Start accepts. Automaton has 10154 states and 14939 transitions. Word has length 81 [2018-11-23 01:32:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:24,856 INFO L480 AbstractCegarLoop]: Abstraction has 10154 states and 14939 transitions. [2018-11-23 01:32:24,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:32:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 10154 states and 14939 transitions. [2018-11-23 01:32:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 01:32:24,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:24,859 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-11-23 01:32:24,859 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:24,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2076609645, now seen corresponding path program 1 times [2018-11-23 01:32:24,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:24,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:24,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:25,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:25,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:32:25,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:32:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:32:25,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:32:25,116 INFO L87 Difference]: Start difference. First operand 10154 states and 14939 transitions. Second operand 8 states. [2018-11-23 01:32:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:25,464 INFO L93 Difference]: Finished difference Result 10201 states and 15011 transitions. [2018-11-23 01:32:25,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:32:25,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-23 01:32:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:25,504 INFO L225 Difference]: With dead ends: 10201 [2018-11-23 01:32:25,505 INFO L226 Difference]: Without dead ends: 10168 [2018-11-23 01:32:25,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:32:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10168 states. [2018-11-23 01:32:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10168 to 10153. [2018-11-23 01:32:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10153 states. [2018-11-23 01:32:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10153 states to 10153 states and 14943 transitions. [2018-11-23 01:32:25,892 INFO L78 Accepts]: Start accepts. Automaton has 10153 states and 14943 transitions. Word has length 78 [2018-11-23 01:32:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:25,893 INFO L480 AbstractCegarLoop]: Abstraction has 10153 states and 14943 transitions. [2018-11-23 01:32:25,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:32:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 10153 states and 14943 transitions. [2018-11-23 01:32:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 01:32:25,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:25,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:25,895 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:25,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash 138780864, now seen corresponding path program 1 times [2018-11-23 01:32:25,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:25,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:25,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:25,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:25,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:26,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:26,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:32:26,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:32:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:32:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:32:26,103 INFO L87 Difference]: Start difference. First operand 10153 states and 14943 transitions. Second operand 8 states. [2018-11-23 01:32:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:26,375 INFO L93 Difference]: Finished difference Result 10188 states and 14996 transitions. [2018-11-23 01:32:26,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:32:26,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-11-23 01:32:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:26,418 INFO L225 Difference]: With dead ends: 10188 [2018-11-23 01:32:26,418 INFO L226 Difference]: Without dead ends: 10155 [2018-11-23 01:32:26,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:32:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10155 states. [2018-11-23 01:32:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10155 to 10140. [2018-11-23 01:32:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10140 states. [2018-11-23 01:32:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10140 states to 10140 states and 14928 transitions. [2018-11-23 01:32:26,839 INFO L78 Accepts]: Start accepts. Automaton has 10140 states and 14928 transitions. Word has length 79 [2018-11-23 01:32:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:26,840 INFO L480 AbstractCegarLoop]: Abstraction has 10140 states and 14928 transitions. [2018-11-23 01:32:26,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:32:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 10140 states and 14928 transitions. [2018-11-23 01:32:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 01:32:26,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:26,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:26,842 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:26,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash -155844014, now seen corresponding path program 1 times [2018-11-23 01:32:26,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:26,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:26,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:26,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:26,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:26,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:26,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:32:26,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:32:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:32:26,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:26,962 INFO L87 Difference]: Start difference. First operand 10140 states and 14928 transitions. Second operand 4 states. [2018-11-23 01:32:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:27,129 INFO L93 Difference]: Finished difference Result 10235 states and 15058 transitions. [2018-11-23 01:32:27,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:32:27,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-23 01:32:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:27,159 INFO L225 Difference]: With dead ends: 10235 [2018-11-23 01:32:27,159 INFO L226 Difference]: Without dead ends: 10195 [2018-11-23 01:32:27,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:32:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10195 states. [2018-11-23 01:32:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10195 to 10146. [2018-11-23 01:32:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10146 states. [2018-11-23 01:32:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 14940 transitions. [2018-11-23 01:32:27,415 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 14940 transitions. Word has length 80 [2018-11-23 01:32:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:27,415 INFO L480 AbstractCegarLoop]: Abstraction has 10146 states and 14940 transitions. [2018-11-23 01:32:27,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:32:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 14940 transitions. [2018-11-23 01:32:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 01:32:27,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:27,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:27,418 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:27,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:27,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1573082095, now seen corresponding path program 1 times [2018-11-23 01:32:27,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:27,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:27,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:27,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:27,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:27,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:27,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:32:27,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:32:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:32:27,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:32:27,591 INFO L87 Difference]: Start difference. First operand 10146 states and 14940 transitions. Second operand 8 states. [2018-11-23 01:32:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:27,812 INFO L93 Difference]: Finished difference Result 10215 states and 15043 transitions. [2018-11-23 01:32:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:32:27,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-11-23 01:32:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:27,839 INFO L225 Difference]: With dead ends: 10215 [2018-11-23 01:32:27,839 INFO L226 Difference]: Without dead ends: 10194 [2018-11-23 01:32:27,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:32:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10194 states. [2018-11-23 01:32:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10194 to 10170. [2018-11-23 01:32:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10170 states. [2018-11-23 01:32:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 14972 transitions. [2018-11-23 01:32:28,228 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 14972 transitions. Word has length 90 [2018-11-23 01:32:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:28,228 INFO L480 AbstractCegarLoop]: Abstraction has 10170 states and 14972 transitions. [2018-11-23 01:32:28,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:32:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 14972 transitions. [2018-11-23 01:32:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 01:32:28,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:28,231 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-11-23 01:32:28,231 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:28,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1945207263, now seen corresponding path program 1 times [2018-11-23 01:32:28,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:28,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:28,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:28,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:28,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:28,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:32:28,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:32:28,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:32:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:32:28,427 INFO L87 Difference]: Start difference. First operand 10170 states and 14972 transitions. Second operand 8 states. [2018-11-23 01:32:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:28,685 INFO L93 Difference]: Finished difference Result 10239 states and 15075 transitions. [2018-11-23 01:32:28,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:32:28,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-11-23 01:32:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:28,717 INFO L225 Difference]: With dead ends: 10239 [2018-11-23 01:32:28,717 INFO L226 Difference]: Without dead ends: 10218 [2018-11-23 01:32:28,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:32:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10218 states. [2018-11-23 01:32:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10218 to 10191. [2018-11-23 01:32:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2018-11-23 01:32:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 14999 transitions. [2018-11-23 01:32:29,020 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 14999 transitions. Word has length 92 [2018-11-23 01:32:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:29,020 INFO L480 AbstractCegarLoop]: Abstraction has 10191 states and 14999 transitions. [2018-11-23 01:32:29,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:32:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 14999 transitions. [2018-11-23 01:32:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 01:32:29,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:29,023 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-11-23 01:32:29,023 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:29,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:29,023 INFO L82 PathProgramCache]: Analyzing trace with hash -453996701, now seen corresponding path program 1 times [2018-11-23 01:32:29,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:29,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:29,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:29,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:29,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:29,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:29,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:32:29,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:32:29,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:32:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:32:29,169 INFO L87 Difference]: Start difference. First operand 10191 states and 14999 transitions. Second operand 5 states. [2018-11-23 01:32:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:30,604 INFO L93 Difference]: Finished difference Result 23792 states and 36804 transitions. [2018-11-23 01:32:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:32:30,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-23 01:32:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:30,649 INFO L225 Difference]: With dead ends: 23792 [2018-11-23 01:32:30,649 INFO L226 Difference]: Without dead ends: 13673 [2018-11-23 01:32:30,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:32:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13673 states. [2018-11-23 01:32:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13673 to 13609. [2018-11-23 01:32:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13609 states. [2018-11-23 01:32:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13609 states to 13609 states and 20344 transitions. [2018-11-23 01:32:31,030 INFO L78 Accepts]: Start accepts. Automaton has 13609 states and 20344 transitions. Word has length 91 [2018-11-23 01:32:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:31,030 INFO L480 AbstractCegarLoop]: Abstraction has 13609 states and 20344 transitions. [2018-11-23 01:32:31,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:32:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13609 states and 20344 transitions. [2018-11-23 01:32:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 01:32:31,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:31,032 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-11-23 01:32:31,032 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:31,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:31,033 INFO L82 PathProgramCache]: Analyzing trace with hash -187963071, now seen corresponding path program 1 times [2018-11-23 01:32:31,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:31,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:31,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:31,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:31,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:31,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 01:32:31,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:32:31,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:32:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:32:31,322 INFO L87 Difference]: Start difference. First operand 13609 states and 20344 transitions. Second operand 12 states. [2018-11-23 01:32:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:31,936 INFO L93 Difference]: Finished difference Result 13707 states and 20461 transitions. [2018-11-23 01:32:31,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:32:31,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-11-23 01:32:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:31,982 INFO L225 Difference]: With dead ends: 13707 [2018-11-23 01:32:31,982 INFO L226 Difference]: Without dead ends: 13688 [2018-11-23 01:32:31,989 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-11-23 01:32:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13688 states. [2018-11-23 01:32:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 13642. [2018-11-23 01:32:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13642 states. [2018-11-23 01:32:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13642 states to 13642 states and 20380 transitions. [2018-11-23 01:32:32,376 INFO L78 Accepts]: Start accepts. Automaton has 13642 states and 20380 transitions. Word has length 91 [2018-11-23 01:32:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:32,377 INFO L480 AbstractCegarLoop]: Abstraction has 13642 states and 20380 transitions. [2018-11-23 01:32:32,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:32:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 13642 states and 20380 transitions. [2018-11-23 01:32:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 01:32:32,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:32,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:32,379 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:32,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash -248637483, now seen corresponding path program 1 times [2018-11-23 01:32:32,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:32,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:32,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:32,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:32,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:32,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:32,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 01:32:32,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:32:32,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:32:32,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:32:32,573 INFO L87 Difference]: Start difference. First operand 13642 states and 20380 transitions. Second operand 12 states. [2018-11-23 01:32:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:33,252 INFO L93 Difference]: Finished difference Result 13765 states and 20617 transitions. [2018-11-23 01:32:33,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:32:33,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-11-23 01:32:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:33,295 INFO L225 Difference]: With dead ends: 13765 [2018-11-23 01:32:33,296 INFO L226 Difference]: Without dead ends: 13746 [2018-11-23 01:32:33,304 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-11-23 01:32:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13746 states. [2018-11-23 01:32:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13746 to 13708. [2018-11-23 01:32:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13708 states. [2018-11-23 01:32:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13708 states to 13708 states and 20528 transitions. [2018-11-23 01:32:33,677 INFO L78 Accepts]: Start accepts. Automaton has 13708 states and 20528 transitions. Word has length 99 [2018-11-23 01:32:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:33,677 INFO L480 AbstractCegarLoop]: Abstraction has 13708 states and 20528 transitions. [2018-11-23 01:32:33,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:32:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13708 states and 20528 transitions. [2018-11-23 01:32:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 01:32:33,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:33,680 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-11-23 01:32:33,680 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:33,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:33,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1019274124, now seen corresponding path program 1 times [2018-11-23 01:32:33,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:33,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:33,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:33,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:33,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:32:33,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:32:33,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:32:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:32:33,818 INFO L87 Difference]: Start difference. First operand 13708 states and 20528 transitions. Second operand 8 states. [2018-11-23 01:32:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:34,052 INFO L93 Difference]: Finished difference Result 13800 states and 20641 transitions. [2018-11-23 01:32:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:32:34,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-11-23 01:32:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:34,085 INFO L225 Difference]: With dead ends: 13800 [2018-11-23 01:32:34,085 INFO L226 Difference]: Without dead ends: 13774 [2018-11-23 01:32:34,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:32:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13774 states. [2018-11-23 01:32:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13774 to 13724. [2018-11-23 01:32:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13724 states. [2018-11-23 01:32:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13724 states to 13724 states and 20534 transitions. [2018-11-23 01:32:34,391 INFO L78 Accepts]: Start accepts. Automaton has 13724 states and 20534 transitions. Word has length 100 [2018-11-23 01:32:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:34,391 INFO L480 AbstractCegarLoop]: Abstraction has 13724 states and 20534 transitions. [2018-11-23 01:32:34,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:32:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 13724 states and 20534 transitions. [2018-11-23 01:32:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 01:32:34,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:34,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] [2018-11-23 01:32:34,393 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:34,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:34,394 INFO L82 PathProgramCache]: Analyzing trace with hash -947941990, now seen corresponding path program 1 times [2018-11-23 01:32:34,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:34,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:34,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:34,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:34,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:34,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:34,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:32:34,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:32:34,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:32:34,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:32:34,548 INFO L87 Difference]: Start difference. First operand 13724 states and 20534 transitions. Second operand 9 states. [2018-11-23 01:32:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:35,181 INFO L93 Difference]: Finished difference Result 27545 states and 42606 transitions. [2018-11-23 01:32:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:32:35,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2018-11-23 01:32:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:35,212 INFO L225 Difference]: With dead ends: 27545 [2018-11-23 01:32:35,212 INFO L226 Difference]: Without dead ends: 13860 [2018-11-23 01:32:35,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:32:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13860 states. [2018-11-23 01:32:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13860 to 13762. [2018-11-23 01:32:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13762 states. [2018-11-23 01:32:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13762 states to 13762 states and 20576 transitions. [2018-11-23 01:32:35,607 INFO L78 Accepts]: Start accepts. Automaton has 13762 states and 20576 transitions. Word has length 100 [2018-11-23 01:32:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:35,607 INFO L480 AbstractCegarLoop]: Abstraction has 13762 states and 20576 transitions. [2018-11-23 01:32:35,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:32:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 13762 states and 20576 transitions. [2018-11-23 01:32:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 01:32:35,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:35,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:35,610 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:35,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:35,610 INFO L82 PathProgramCache]: Analyzing trace with hash -394719686, now seen corresponding path program 1 times [2018-11-23 01:32:35,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:35,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:35,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:35,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:35,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:35,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:35,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:32:35,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:32:35,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:32:35,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:32:35,739 INFO L87 Difference]: Start difference. First operand 13762 states and 20576 transitions. Second operand 6 states. [2018-11-23 01:32:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:37,070 INFO L93 Difference]: Finished difference Result 27458 states and 42041 transitions. [2018-11-23 01:32:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:32:37,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-11-23 01:32:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:37,106 INFO L225 Difference]: With dead ends: 27458 [2018-11-23 01:32:37,106 INFO L226 Difference]: Without dead ends: 13764 [2018-11-23 01:32:37,151 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-11-23 01:32:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13764 states. [2018-11-23 01:32:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13764 to 13724. [2018-11-23 01:32:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13724 states. [2018-11-23 01:32:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13724 states to 13724 states and 19894 transitions. [2018-11-23 01:32:37,521 INFO L78 Accepts]: Start accepts. Automaton has 13724 states and 19894 transitions. Word has length 107 [2018-11-23 01:32:37,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:37,521 INFO L480 AbstractCegarLoop]: Abstraction has 13724 states and 19894 transitions. [2018-11-23 01:32:37,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:32:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 13724 states and 19894 transitions. [2018-11-23 01:32:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 01:32:37,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:37,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:37,523 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:37,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:37,523 INFO L82 PathProgramCache]: Analyzing trace with hash -632368631, now seen corresponding path program 1 times [2018-11-23 01:32:37,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:37,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:37,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:37,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-11-23 01:32:37,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:37,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 01:32:37,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:32:37,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:32:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:32:37,827 INFO L87 Difference]: Start difference. First operand 13724 states and 19894 transitions. Second operand 12 states. [2018-11-23 01:32:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:38,427 INFO L93 Difference]: Finished difference Result 13826 states and 20035 transitions. [2018-11-23 01:32:38,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:32:38,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-11-23 01:32:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:38,456 INFO L225 Difference]: With dead ends: 13826 [2018-11-23 01:32:38,456 INFO L226 Difference]: Without dead ends: 13807 [2018-11-23 01:32:38,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:32:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13807 states. [2018-11-23 01:32:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13807 to 13759. [2018-11-23 01:32:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-11-23 01:32:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 19946 transitions. [2018-11-23 01:32:38,746 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 19946 transitions. Word has length 103 [2018-11-23 01:32:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:38,746 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 19946 transitions. [2018-11-23 01:32:38,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:32:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 19946 transitions. [2018-11-23 01:32:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 01:32:38,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:38,748 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-11-23 01:32:38,748 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:38,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash 553384738, now seen corresponding path program 1 times [2018-11-23 01:32:38,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:38,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:38,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:38,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 01:32:38,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:32:38,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:32:38,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:32:38,984 INFO L87 Difference]: Start difference. First operand 13759 states and 19946 transitions. Second operand 12 states. [2018-11-23 01:32:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:39,500 INFO L93 Difference]: Finished difference Result 13857 states and 20033 transitions. [2018-11-23 01:32:39,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:32:39,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-11-23 01:32:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:39,535 INFO L225 Difference]: With dead ends: 13857 [2018-11-23 01:32:39,535 INFO L226 Difference]: Without dead ends: 13838 [2018-11-23 01:32:39,541 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-11-23 01:32:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13838 states. [2018-11-23 01:32:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13838 to 13724. [2018-11-23 01:32:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13724 states. [2018-11-23 01:32:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13724 states to 13724 states and 19856 transitions. [2018-11-23 01:32:39,845 INFO L78 Accepts]: Start accepts. Automaton has 13724 states and 19856 transitions. Word has length 111 [2018-11-23 01:32:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:39,846 INFO L480 AbstractCegarLoop]: Abstraction has 13724 states and 19856 transitions. [2018-11-23 01:32:39,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:32:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 13724 states and 19856 transitions. [2018-11-23 01:32:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-23 01:32:39,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:39,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:32:39,848 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:39,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2035877411, now seen corresponding path program 1 times [2018-11-23 01:32:39,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:39,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:40,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:40,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:40,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:40,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:40,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:40,002 INFO L87 Difference]: Start difference. First operand 13724 states and 19856 transitions. Second operand 3 states. [2018-11-23 01:32:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:40,360 INFO L93 Difference]: Finished difference Result 20706 states and 30551 transitions. [2018-11-23 01:32:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:40,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-11-23 01:32:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:40,458 INFO L225 Difference]: With dead ends: 20706 [2018-11-23 01:32:40,458 INFO L226 Difference]: Without dead ends: 13756 [2018-11-23 01:32:40,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13756 states. [2018-11-23 01:32:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13756 to 13756. [2018-11-23 01:32:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-11-23 01:32:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 19884 transitions. [2018-11-23 01:32:40,731 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 19884 transitions. Word has length 120 [2018-11-23 01:32:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:40,732 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 19884 transitions. [2018-11-23 01:32:40,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 19884 transitions. [2018-11-23 01:32:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 01:32:40,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:40,735 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-11-23 01:32:40,735 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:40,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:40,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1598279501, now seen corresponding path program 1 times [2018-11-23 01:32:40,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:40,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:40,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 01:32:40,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:40,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:32:40,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:32:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:32:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:32:40,950 INFO L87 Difference]: Start difference. First operand 13756 states and 19884 transitions. Second operand 13 states. [2018-11-23 01:32:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:41,557 INFO L93 Difference]: Finished difference Result 13939 states and 20141 transitions. [2018-11-23 01:32:41,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:32:41,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-11-23 01:32:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:41,584 INFO L225 Difference]: With dead ends: 13939 [2018-11-23 01:32:41,584 INFO L226 Difference]: Without dead ends: 13920 [2018-11-23 01:32:41,589 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-11-23 01:32:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13920 states. [2018-11-23 01:32:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13920 to 13848. [2018-11-23 01:32:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13848 states. [2018-11-23 01:32:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13848 states to 13848 states and 20024 transitions. [2018-11-23 01:32:41,862 INFO L78 Accepts]: Start accepts. Automaton has 13848 states and 20024 transitions. Word has length 115 [2018-11-23 01:32:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:41,862 INFO L480 AbstractCegarLoop]: Abstraction has 13848 states and 20024 transitions. [2018-11-23 01:32:41,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:32:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 13848 states and 20024 transitions. [2018-11-23 01:32:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 01:32:41,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:41,864 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-11-23 01:32:41,864 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:41,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash -904344803, now seen corresponding path program 1 times [2018-11-23 01:32:41,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:41,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:41,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:41,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:41,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 01:32:42,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:42,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:32:42,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:32:42,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:32:42,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:32:42,066 INFO L87 Difference]: Start difference. First operand 13848 states and 20024 transitions. Second operand 13 states. [2018-11-23 01:32:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:42,732 INFO L93 Difference]: Finished difference Result 14031 states and 20281 transitions. [2018-11-23 01:32:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:32:42,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-11-23 01:32:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:42,758 INFO L225 Difference]: With dead ends: 14031 [2018-11-23 01:32:42,758 INFO L226 Difference]: Without dead ends: 14012 [2018-11-23 01:32:42,763 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-11-23 01:32:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14012 states. [2018-11-23 01:32:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14012 to 13856. [2018-11-23 01:32:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13856 states. [2018-11-23 01:32:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13856 states to 13856 states and 20032 transitions. [2018-11-23 01:32:43,032 INFO L78 Accepts]: Start accepts. Automaton has 13856 states and 20032 transitions. Word has length 115 [2018-11-23 01:32:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:43,032 INFO L480 AbstractCegarLoop]: Abstraction has 13856 states and 20032 transitions. [2018-11-23 01:32:43,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:32:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 13856 states and 20032 transitions. [2018-11-23 01:32:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 01:32:43,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:43,034 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-11-23 01:32:43,034 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:43,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:43,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1782248947, now seen corresponding path program 1 times [2018-11-23 01:32:43,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:43,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 01:32:43,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:43,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:32:43,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:32:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:32:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:32:43,327 INFO L87 Difference]: Start difference. First operand 13856 states and 20032 transitions. Second operand 13 states. [2018-11-23 01:32:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:43,970 INFO L93 Difference]: Finished difference Result 14039 states and 20289 transitions. [2018-11-23 01:32:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:32:43,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-11-23 01:32:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:43,995 INFO L225 Difference]: With dead ends: 14039 [2018-11-23 01:32:43,995 INFO L226 Difference]: Without dead ends: 14020 [2018-11-23 01:32:44,000 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-11-23 01:32:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14020 states. [2018-11-23 01:32:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14020 to 13864. [2018-11-23 01:32:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13864 states. [2018-11-23 01:32:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13864 states to 13864 states and 20040 transitions. [2018-11-23 01:32:44,270 INFO L78 Accepts]: Start accepts. Automaton has 13864 states and 20040 transitions. Word has length 116 [2018-11-23 01:32:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:44,270 INFO L480 AbstractCegarLoop]: Abstraction has 13864 states and 20040 transitions. [2018-11-23 01:32:44,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:32:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 13864 states and 20040 transitions. [2018-11-23 01:32:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 01:32:44,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:44,272 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-11-23 01:32:44,272 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:44,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash 731329676, now seen corresponding path program 1 times [2018-11-23 01:32:44,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:44,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:44,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:44,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:44,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:32:44,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:32:44,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:32:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:32:44,403 INFO L87 Difference]: Start difference. First operand 13864 states and 20040 transitions. Second operand 6 states. [2018-11-23 01:32:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:44,777 INFO L93 Difference]: Finished difference Result 28065 states and 42257 transitions. [2018-11-23 01:32:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:32:44,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-11-23 01:32:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:44,811 INFO L225 Difference]: With dead ends: 28065 [2018-11-23 01:32:44,811 INFO L226 Difference]: Without dead ends: 14268 [2018-11-23 01:32:44,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:32:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2018-11-23 01:32:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 14150. [2018-11-23 01:32:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2018-11-23 01:32:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 20803 transitions. [2018-11-23 01:32:45,144 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 20803 transitions. Word has length 124 [2018-11-23 01:32:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:45,144 INFO L480 AbstractCegarLoop]: Abstraction has 14150 states and 20803 transitions. [2018-11-23 01:32:45,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:32:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 20803 transitions. [2018-11-23 01:32:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 01:32:45,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:45,146 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] [2018-11-23 01:32:45,146 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:45,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1776939680, now seen corresponding path program 1 times [2018-11-23 01:32:45,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:45,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:45,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:45,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:45,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:45,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:45,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:32:45,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:32:45,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:32:45,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:32:45,260 INFO L87 Difference]: Start difference. First operand 14150 states and 20803 transitions. Second operand 6 states. [2018-11-23 01:32:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:45,637 INFO L93 Difference]: Finished difference Result 28313 states and 42751 transitions. [2018-11-23 01:32:45,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:32:45,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-11-23 01:32:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:45,680 INFO L225 Difference]: With dead ends: 28313 [2018-11-23 01:32:45,681 INFO L226 Difference]: Without dead ends: 14230 [2018-11-23 01:32:45,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:32:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14230 states. [2018-11-23 01:32:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14230 to 14182. [2018-11-23 01:32:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14182 states. [2018-11-23 01:32:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14182 states to 14182 states and 20835 transitions. [2018-11-23 01:32:46,248 INFO L78 Accepts]: Start accepts. Automaton has 14182 states and 20835 transitions. Word has length 123 [2018-11-23 01:32:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:46,248 INFO L480 AbstractCegarLoop]: Abstraction has 14182 states and 20835 transitions. [2018-11-23 01:32:46,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:32:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 14182 states and 20835 transitions. [2018-11-23 01:32:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 01:32:46,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:46,251 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-11-23 01:32:46,251 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:46,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:46,251 INFO L82 PathProgramCache]: Analyzing trace with hash 172472717, now seen corresponding path program 1 times [2018-11-23 01:32:46,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:46,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:46,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:46,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:46,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:46,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:46,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:46,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:46,357 INFO L87 Difference]: Start difference. First operand 14182 states and 20835 transitions. Second operand 3 states. [2018-11-23 01:32:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:46,901 INFO L93 Difference]: Finished difference Result 31833 states and 49251 transitions. [2018-11-23 01:32:46,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:46,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-23 01:32:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:46,948 INFO L225 Difference]: With dead ends: 31833 [2018-11-23 01:32:46,948 INFO L226 Difference]: Without dead ends: 17718 [2018-11-23 01:32:46,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17718 states. [2018-11-23 01:32:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17718 to 17684. [2018-11-23 01:32:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17684 states. [2018-11-23 01:32:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17684 states to 17684 states and 26922 transitions. [2018-11-23 01:32:47,390 INFO L78 Accepts]: Start accepts. Automaton has 17684 states and 26922 transitions. Word has length 125 [2018-11-23 01:32:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:47,391 INFO L480 AbstractCegarLoop]: Abstraction has 17684 states and 26922 transitions. [2018-11-23 01:32:47,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 17684 states and 26922 transitions. [2018-11-23 01:32:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 01:32:47,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:47,392 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-11-23 01:32:47,393 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:47,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash -556035203, now seen corresponding path program 1 times [2018-11-23 01:32:47,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:47,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:47,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:47,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:47,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:32:47,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:32:47,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:32:47,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:47,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:32:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 01:32:48,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:32:48,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-23 01:32:48,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:32:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:32:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:32:48,016 INFO L87 Difference]: Start difference. First operand 17684 states and 26922 transitions. Second operand 8 states. [2018-11-23 01:32:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:48,909 INFO L93 Difference]: Finished difference Result 35661 states and 56802 transitions. [2018-11-23 01:32:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:32:48,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2018-11-23 01:32:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:48,990 INFO L225 Difference]: With dead ends: 35661 [2018-11-23 01:32:48,990 INFO L226 Difference]: Without dead ends: 18044 [2018-11-23 01:32:49,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:32:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18044 states. [2018-11-23 01:32:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18044 to 17864. [2018-11-23 01:32:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17864 states. [2018-11-23 01:32:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17864 states to 17864 states and 27192 transitions. [2018-11-23 01:32:49,830 INFO L78 Accepts]: Start accepts. Automaton has 17864 states and 27192 transitions. Word has length 122 [2018-11-23 01:32:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:49,831 INFO L480 AbstractCegarLoop]: Abstraction has 17864 states and 27192 transitions. [2018-11-23 01:32:49,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:32:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 17864 states and 27192 transitions. [2018-11-23 01:32:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 01:32:49,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:49,835 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-11-23 01:32:49,835 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:49,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1099519139, now seen corresponding path program 1 times [2018-11-23 01:32:49,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:49,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:49,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:49,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:49,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:49,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:49,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:49,958 INFO L87 Difference]: Start difference. First operand 17864 states and 27192 transitions. Second operand 3 states. [2018-11-23 01:32:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:50,527 INFO L93 Difference]: Finished difference Result 35833 states and 56857 transitions. [2018-11-23 01:32:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:50,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-11-23 01:32:50,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:50,597 INFO L225 Difference]: With dead ends: 35833 [2018-11-23 01:32:50,598 INFO L226 Difference]: Without dead ends: 18036 [2018-11-23 01:32:50,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18036 states. [2018-11-23 01:32:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18036 to 17888. [2018-11-23 01:32:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17888 states. [2018-11-23 01:32:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17888 states to 17888 states and 27232 transitions. [2018-11-23 01:32:51,217 INFO L78 Accepts]: Start accepts. Automaton has 17888 states and 27232 transitions. Word has length 132 [2018-11-23 01:32:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:51,218 INFO L480 AbstractCegarLoop]: Abstraction has 17888 states and 27232 transitions. [2018-11-23 01:32:51,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 17888 states and 27232 transitions. [2018-11-23 01:32:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 01:32:51,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:51,221 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] [2018-11-23 01:32:51,221 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:51,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1402919305, now seen corresponding path program 1 times [2018-11-23 01:32:51,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:51,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:32:51,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:51,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:32:51,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:32:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:51,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:51,348 INFO L87 Difference]: Start difference. First operand 17888 states and 27232 transitions. Second operand 3 states. [2018-11-23 01:32:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:51,870 INFO L93 Difference]: Finished difference Result 29598 states and 46185 transitions. [2018-11-23 01:32:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:51,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-23 01:32:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:51,943 INFO L225 Difference]: With dead ends: 29598 [2018-11-23 01:32:51,943 INFO L226 Difference]: Without dead ends: 20592 [2018-11-23 01:32:51,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20592 states. [2018-11-23 01:32:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20592 to 20383. [2018-11-23 01:32:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20383 states. [2018-11-23 01:32:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20383 states to 20383 states and 31158 transitions. [2018-11-23 01:32:52,752 INFO L78 Accepts]: Start accepts. Automaton has 20383 states and 31158 transitions. Word has length 131 [2018-11-23 01:32:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:52,752 INFO L480 AbstractCegarLoop]: Abstraction has 20383 states and 31158 transitions. [2018-11-23 01:32:52,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:32:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 20383 states and 31158 transitions. [2018-11-23 01:32:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 01:32:52,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:52,755 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-11-23 01:32:52,755 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:52,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1962234420, now seen corresponding path program 1 times [2018-11-23 01:32:52,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:52,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:52,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:52,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 01:32:52,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:52,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 01:32:52,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:32:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:32:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:32:52,941 INFO L87 Difference]: Start difference. First operand 20383 states and 31158 transitions. Second operand 12 states. [2018-11-23 01:32:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:53,443 INFO L93 Difference]: Finished difference Result 20565 states and 31397 transitions. [2018-11-23 01:32:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:32:53,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-11-23 01:32:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:53,494 INFO L225 Difference]: With dead ends: 20565 [2018-11-23 01:32:53,495 INFO L226 Difference]: Without dead ends: 20538 [2018-11-23 01:32:53,503 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-11-23 01:32:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20538 states. [2018-11-23 01:32:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20538 to 20487. [2018-11-23 01:32:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2018-11-23 01:32:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 31283 transitions. [2018-11-23 01:32:54,069 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 31283 transitions. Word has length 130 [2018-11-23 01:32:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:54,070 INFO L480 AbstractCegarLoop]: Abstraction has 20487 states and 31283 transitions. [2018-11-23 01:32:54,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:32:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 31283 transitions. [2018-11-23 01:32:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 01:32:54,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:54,073 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-11-23 01:32:54,074 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:54,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash -15890301, now seen corresponding path program 1 times [2018-11-23 01:32:54,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:54,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:54,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 01:32:54,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:54,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:32:54,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:32:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:32:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:32:54,203 INFO L87 Difference]: Start difference. First operand 20487 states and 31283 transitions. Second operand 7 states. [2018-11-23 01:32:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:54,764 INFO L93 Difference]: Finished difference Result 40937 states and 62526 transitions. [2018-11-23 01:32:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:32:54,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-11-23 01:32:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:32:54,832 INFO L225 Difference]: With dead ends: 40937 [2018-11-23 01:32:54,832 INFO L226 Difference]: Without dead ends: 20487 [2018-11-23 01:32:54,885 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-11-23 01:32:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2018-11-23 01:32:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20487. [2018-11-23 01:32:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2018-11-23 01:32:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 31282 transitions. [2018-11-23 01:32:55,630 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 31282 transitions. Word has length 132 [2018-11-23 01:32:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:32:55,630 INFO L480 AbstractCegarLoop]: Abstraction has 20487 states and 31282 transitions. [2018-11-23 01:32:55,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:32:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 31282 transitions. [2018-11-23 01:32:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 01:32:55,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:32:55,633 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-11-23 01:32:55,633 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:32:55,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2058872152, now seen corresponding path program 1 times [2018-11-23 01:32:55,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:55,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:55,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:55,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:55,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 01:32:55,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:32:55,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:32:55,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:56,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:32:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 01:32:56,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:32:56,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-23 01:32:56,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:32:56,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:32:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:32:56,470 INFO L87 Difference]: Start difference. First operand 20487 states and 31282 transitions. Second operand 10 states. [2018-11-23 01:33:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:33:20,293 INFO L93 Difference]: Finished difference Result 104435 states and 192164 transitions. [2018-11-23 01:33:20,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 01:33:20,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-11-23 01:33:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:33:20,614 INFO L225 Difference]: With dead ends: 104435 [2018-11-23 01:33:20,614 INFO L226 Difference]: Without dead ends: 84008 [2018-11-23 01:33:20,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-23 01:33:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84008 states. [2018-11-23 01:33:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84008 to 81793. [2018-11-23 01:33:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81793 states. [2018-11-23 01:33:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81793 states to 81793 states and 150448 transitions. [2018-11-23 01:33:23,740 INFO L78 Accepts]: Start accepts. Automaton has 81793 states and 150448 transitions. Word has length 146 [2018-11-23 01:33:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:33:23,740 INFO L480 AbstractCegarLoop]: Abstraction has 81793 states and 150448 transitions. [2018-11-23 01:33:23,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:33:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 81793 states and 150448 transitions. [2018-11-23 01:33:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 01:33:23,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:33:23,744 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-11-23 01:33:23,744 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:33:23,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1772791630, now seen corresponding path program 1 times [2018-11-23 01:33:23,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:23,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:23,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:23,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 01:33:24,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:33:24,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:33:24,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:24,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:33:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 01:33:24,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:33:24,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 10 [2018-11-23 01:33:24,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:33:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:33:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:33:24,885 INFO L87 Difference]: Start difference. First operand 81793 states and 150448 transitions. Second operand 10 states. [2018-11-23 01:33:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:33:48,066 INFO L93 Difference]: Finished difference Result 83990 states and 153433 transitions. [2018-11-23 01:33:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:33:48,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2018-11-23 01:33:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:33:48,074 INFO L225 Difference]: With dead ends: 83990 [2018-11-23 01:33:48,075 INFO L226 Difference]: Without dead ends: 2256 [2018-11-23 01:33:48,341 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-11-23 01:33:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2018-11-23 01:33:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1591. [2018-11-23 01:33:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2018-11-23 01:33:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 1906 transitions. [2018-11-23 01:33:48,387 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 1906 transitions. Word has length 155 [2018-11-23 01:33:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:33:48,388 INFO L480 AbstractCegarLoop]: Abstraction has 1591 states and 1906 transitions. [2018-11-23 01:33:48,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:33:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1906 transitions. [2018-11-23 01:33:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 01:33:48,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:33:48,389 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] [2018-11-23 01:33:48,389 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:33:48,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash -777913348, now seen corresponding path program 1 times [2018-11-23 01:33:48,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:48,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:48,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-23 01:33:48,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:33:48,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:33:48,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:33:48,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:33:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:33:48,532 INFO L87 Difference]: Start difference. First operand 1591 states and 1906 transitions. Second operand 9 states. [2018-11-23 01:33:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:33:48,646 INFO L93 Difference]: Finished difference Result 1665 states and 2000 transitions. [2018-11-23 01:33:48,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:33:48,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2018-11-23 01:33:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:33:48,648 INFO L225 Difference]: With dead ends: 1665 [2018-11-23 01:33:48,649 INFO L226 Difference]: Without dead ends: 1550 [2018-11-23 01:33:48,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:33:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2018-11-23 01:33:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1522. [2018-11-23 01:33:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2018-11-23 01:33:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1829 transitions. [2018-11-23 01:33:48,686 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1829 transitions. Word has length 157 [2018-11-23 01:33:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:33:48,687 INFO L480 AbstractCegarLoop]: Abstraction has 1522 states and 1829 transitions. [2018-11-23 01:33:48,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:33:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1829 transitions. [2018-11-23 01:33:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-23 01:33:48,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:33:48,689 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] [2018-11-23 01:33:48,689 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:33:48,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1647302519, now seen corresponding path program 1 times [2018-11-23 01:33:48,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:48,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:48,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:48,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 01:33:49,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:33:49,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:33:49,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:33:49,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:33:49,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:33:49,239 INFO L87 Difference]: Start difference. First operand 1522 states and 1829 transitions. Second operand 7 states. [2018-11-23 01:33:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:33:49,516 INFO L93 Difference]: Finished difference Result 1885 states and 2230 transitions. [2018-11-23 01:33:49,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:33:49,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2018-11-23 01:33:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:33:49,520 INFO L225 Difference]: With dead ends: 1885 [2018-11-23 01:33:49,520 INFO L226 Difference]: Without dead ends: 1544 [2018-11-23 01:33:49,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:33:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-11-23 01:33:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1525. [2018-11-23 01:33:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2018-11-23 01:33:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1833 transitions. [2018-11-23 01:33:49,559 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1833 transitions. Word has length 164 [2018-11-23 01:33:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:33:49,559 INFO L480 AbstractCegarLoop]: Abstraction has 1525 states and 1833 transitions. [2018-11-23 01:33:49,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:33:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1833 transitions. [2018-11-23 01:33:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-23 01:33:49,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:33:49,561 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-11-23 01:33:49,561 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:33:49,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash -509404922, now seen corresponding path program 1 times [2018-11-23 01:33:49,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:49,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:49,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:49,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 01:33:50,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:33:50,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:33:50,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:50,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:33:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 01:33:50,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:33:50,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-23 01:33:50,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:33:50,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:33:50,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:33:50,585 INFO L87 Difference]: Start difference. First operand 1525 states and 1833 transitions. Second operand 11 states. [2018-11-23 01:33:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:33:51,315 INFO L93 Difference]: Finished difference Result 2442 states and 2977 transitions. [2018-11-23 01:33:51,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:33:51,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2018-11-23 01:33:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:33:51,319 INFO L225 Difference]: With dead ends: 2442 [2018-11-23 01:33:51,319 INFO L226 Difference]: Without dead ends: 1523 [2018-11-23 01:33:51,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:33:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2018-11-23 01:33:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1499. [2018-11-23 01:33:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-11-23 01:33:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1786 transitions. [2018-11-23 01:33:51,362 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1786 transitions. Word has length 165 [2018-11-23 01:33:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:33:51,362 INFO L480 AbstractCegarLoop]: Abstraction has 1499 states and 1786 transitions. [2018-11-23 01:33:51,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:33:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1786 transitions. [2018-11-23 01:33:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-23 01:33:51,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:33:51,365 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] [2018-11-23 01:33:51,365 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:33:51,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1468955782, now seen corresponding path program 1 times [2018-11-23 01:33:51,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:51,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:51,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 01:33:51,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:33:51,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:33:51,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:33:51,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:33:51,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:33:51,517 INFO L87 Difference]: Start difference. First operand 1499 states and 1786 transitions. Second operand 6 states. [2018-11-23 01:33:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:33:51,607 INFO L93 Difference]: Finished difference Result 2150 states and 2560 transitions. [2018-11-23 01:33:51,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:33:51,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2018-11-23 01:33:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:33:51,611 INFO L225 Difference]: With dead ends: 2150 [2018-11-23 01:33:51,611 INFO L226 Difference]: Without dead ends: 1532 [2018-11-23 01:33:51,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:33:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-11-23 01:33:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1492. [2018-11-23 01:33:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2018-11-23 01:33:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1773 transitions. [2018-11-23 01:33:51,652 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1773 transitions. Word has length 173 [2018-11-23 01:33:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:33:51,653 INFO L480 AbstractCegarLoop]: Abstraction has 1492 states and 1773 transitions. [2018-11-23 01:33:51,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:33:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1773 transitions. [2018-11-23 01:33:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-23 01:33:51,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:33:51,655 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] [2018-11-23 01:33:51,655 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:33:51,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash 132541115, now seen corresponding path program 1 times [2018-11-23 01:33:51,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:51,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:51,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 01:33:51,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:33:51,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:33:51,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:33:51,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:33:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:33:51,800 INFO L87 Difference]: Start difference. First operand 1492 states and 1773 transitions. Second operand 6 states. [2018-11-23 01:33:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:33:51,904 INFO L93 Difference]: Finished difference Result 2242 states and 2641 transitions. [2018-11-23 01:33:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:33:51,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2018-11-23 01:33:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:33:51,908 INFO L225 Difference]: With dead ends: 2242 [2018-11-23 01:33:51,908 INFO L226 Difference]: Without dead ends: 1461 [2018-11-23 01:33:51,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:33:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2018-11-23 01:33:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1423. [2018-11-23 01:33:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-11-23 01:33:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1678 transitions. [2018-11-23 01:33:51,948 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1678 transitions. Word has length 171 [2018-11-23 01:33:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:33:51,948 INFO L480 AbstractCegarLoop]: Abstraction has 1423 states and 1678 transitions. [2018-11-23 01:33:51,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:33:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1678 transitions. [2018-11-23 01:33:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-23 01:33:51,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:33:51,950 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] [2018-11-23 01:33:51,950 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:33:51,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1903101847, now seen corresponding path program 1 times [2018-11-23 01:33:51,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:51,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:51,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 01:33:52,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:33:52,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:33:52,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:33:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:33:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:33:52,113 INFO L87 Difference]: Start difference. First operand 1423 states and 1678 transitions. Second operand 5 states. [2018-11-23 01:34:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:04,378 INFO L93 Difference]: Finished difference Result 2041 states and 2390 transitions. [2018-11-23 01:34:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:34:04,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2018-11-23 01:34:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:04,380 INFO L225 Difference]: With dead ends: 2041 [2018-11-23 01:34:04,380 INFO L226 Difference]: Without dead ends: 1148 [2018-11-23 01:34:04,381 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-11-23 01:34:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-11-23 01:34:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 935. [2018-11-23 01:34:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2018-11-23 01:34:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1069 transitions. [2018-11-23 01:34:04,409 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1069 transitions. Word has length 183 [2018-11-23 01:34:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:04,409 INFO L480 AbstractCegarLoop]: Abstraction has 935 states and 1069 transitions. [2018-11-23 01:34:04,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:34:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1069 transitions. [2018-11-23 01:34:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 01:34:04,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:04,411 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-11-23 01:34:04,411 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:04,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash 728506049, now seen corresponding path program 1 times [2018-11-23 01:34:04,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:04,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:04,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:04,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-23 01:34:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 01:34:04,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 01:34:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 01:34:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:34:04,669 INFO L87 Difference]: Start difference. First operand 935 states and 1069 transitions. Second operand 15 states. [2018-11-23 01:34:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:40,863 INFO L93 Difference]: Finished difference Result 1868 states and 2118 transitions. [2018-11-23 01:34:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 01:34:40,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 175 [2018-11-23 01:34:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:40,865 INFO L225 Difference]: With dead ends: 1868 [2018-11-23 01:34:40,865 INFO L226 Difference]: Without dead ends: 1304 [2018-11-23 01:34:40,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2018-11-23 01:34:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2018-11-23 01:34:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1090. [2018-11-23 01:34:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-11-23 01:34:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1240 transitions. [2018-11-23 01:34:40,903 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1240 transitions. Word has length 175 [2018-11-23 01:34:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:40,903 INFO L480 AbstractCegarLoop]: Abstraction has 1090 states and 1240 transitions. [2018-11-23 01:34:40,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 01:34:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1240 transitions. [2018-11-23 01:34:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 01:34:40,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:40,904 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, 1] [2018-11-23 01:34:40,904 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:40,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash -706862468, now seen corresponding path program 1 times [2018-11-23 01:34:40,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:40,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:40,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-23 01:34:41,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:41,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:34:41,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:34:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:34:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:34:41,089 INFO L87 Difference]: Start difference. First operand 1090 states and 1240 transitions. Second operand 13 states. [2018-11-23 01:34:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:41,473 INFO L93 Difference]: Finished difference Result 1120 states and 1274 transitions. [2018-11-23 01:34:41,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:34:41,474 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 176 [2018-11-23 01:34:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:41,475 INFO L225 Difference]: With dead ends: 1120 [2018-11-23 01:34:41,476 INFO L226 Difference]: Without dead ends: 786 [2018-11-23 01:34:41,476 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-11-23 01:34:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2018-11-23 01:34:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2018-11-23 01:34:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2018-11-23 01:34:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 892 transitions. [2018-11-23 01:34:41,505 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 892 transitions. Word has length 176 [2018-11-23 01:34:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:41,505 INFO L480 AbstractCegarLoop]: Abstraction has 786 states and 892 transitions. [2018-11-23 01:34:41,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:34:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 892 transitions. [2018-11-23 01:34:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-23 01:34:41,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:41,506 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-11-23 01:34:41,506 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:41,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash 123425086, now seen corresponding path program 1 times [2018-11-23 01:34:41,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:41,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:41,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 01:34:41,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:41,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:34:41,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:34:41,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:34:41,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:34:41,708 INFO L87 Difference]: Start difference. First operand 786 states and 892 transitions. Second operand 13 states. [2018-11-23 01:34:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:42,182 INFO L93 Difference]: Finished difference Result 790 states and 895 transitions. [2018-11-23 01:34:42,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:34:42,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2018-11-23 01:34:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:42,184 INFO L225 Difference]: With dead ends: 790 [2018-11-23 01:34:42,184 INFO L226 Difference]: Without dead ends: 643 [2018-11-23 01:34:42,185 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-11-23 01:34:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-23 01:34:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2018-11-23 01:34:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-11-23 01:34:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 736 transitions. [2018-11-23 01:34:42,208 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 736 transitions. Word has length 194 [2018-11-23 01:34:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:42,208 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 736 transitions. [2018-11-23 01:34:42,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:34:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 736 transitions. [2018-11-23 01:34:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-23 01:34:42,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:42,209 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] [2018-11-23 01:34:42,210 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:42,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1447572103, now seen corresponding path program 1 times [2018-11-23 01:34:42,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:42,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:42,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 01:34:42,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:42,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:34:42,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:34:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:34:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:34:42,322 INFO L87 Difference]: Start difference. First operand 643 states and 736 transitions. Second operand 6 states. [2018-11-23 01:34:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:42,365 INFO L93 Difference]: Finished difference Result 647 states and 739 transitions. [2018-11-23 01:34:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:34:42,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2018-11-23 01:34:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:42,366 INFO L225 Difference]: With dead ends: 647 [2018-11-23 01:34:42,366 INFO L226 Difference]: Without dead ends: 552 [2018-11-23 01:34:42,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:34:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-11-23 01:34:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2018-11-23 01:34:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 01:34:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 625 transitions. [2018-11-23 01:34:42,386 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 625 transitions. Word has length 203 [2018-11-23 01:34:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:42,386 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 625 transitions. [2018-11-23 01:34:42,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:34:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 625 transitions. [2018-11-23 01:34:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-23 01:34:42,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:42,387 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] [2018-11-23 01:34:42,387 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:42,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash 261483132, now seen corresponding path program 1 times [2018-11-23 01:34:42,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:42,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:42,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:42,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:42,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 01:34:42,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:42,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 01:34:42,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:34:42,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:34:42,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:34:42,582 INFO L87 Difference]: Start difference. First operand 552 states and 625 transitions. Second operand 12 states. [2018-11-23 01:34:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:42,732 INFO L93 Difference]: Finished difference Result 635 states and 737 transitions. [2018-11-23 01:34:42,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:34:42,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2018-11-23 01:34:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:42,734 INFO L225 Difference]: With dead ends: 635 [2018-11-23 01:34:42,735 INFO L226 Difference]: Without dead ends: 569 [2018-11-23 01:34:42,735 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-11-23 01:34:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-11-23 01:34:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 558. [2018-11-23 01:34:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-11-23 01:34:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 626 transitions. [2018-11-23 01:34:42,756 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 626 transitions. Word has length 211 [2018-11-23 01:34:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:42,757 INFO L480 AbstractCegarLoop]: Abstraction has 558 states and 626 transitions. [2018-11-23 01:34:42,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:34:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 626 transitions. [2018-11-23 01:34:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-23 01:34:42,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:42,758 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] [2018-11-23 01:34:42,759 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:42,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:42,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1191398305, now seen corresponding path program 1 times [2018-11-23 01:34:42,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:42,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:42,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 01:34:42,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:42,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 01:34:42,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:34:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:34:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:34:42,912 INFO L87 Difference]: Start difference. First operand 558 states and 626 transitions. Second operand 10 states. [2018-11-23 01:34:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:43,172 INFO L93 Difference]: Finished difference Result 1039 states and 1165 transitions. [2018-11-23 01:34:43,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:34:43,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2018-11-23 01:34:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:43,175 INFO L225 Difference]: With dead ends: 1039 [2018-11-23 01:34:43,175 INFO L226 Difference]: Without dead ends: 939 [2018-11-23 01:34:43,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-23 01:34:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-11-23 01:34:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 420. [2018-11-23 01:34:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-11-23 01:34:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 454 transitions. [2018-11-23 01:34:43,196 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 454 transitions. Word has length 219 [2018-11-23 01:34:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:43,196 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 454 transitions. [2018-11-23 01:34:43,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:34:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 454 transitions. [2018-11-23 01:34:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-23 01:34:43,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:43,197 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] [2018-11-23 01:34:43,197 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:43,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash -730860393, now seen corresponding path program 1 times [2018-11-23 01:34:43,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:43,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:43,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:43,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 01:34:43,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:43,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:34:43,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:34:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:34:43,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:34:43,315 INFO L87 Difference]: Start difference. First operand 420 states and 454 transitions. Second operand 4 states. [2018-11-23 01:34:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:43,677 INFO L93 Difference]: Finished difference Result 552 states and 600 transitions. [2018-11-23 01:34:43,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:34:43,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-11-23 01:34:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:43,679 INFO L225 Difference]: With dead ends: 552 [2018-11-23 01:34:43,679 INFO L226 Difference]: Without dead ends: 445 [2018-11-23 01:34:43,679 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-11-23 01:34:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-11-23 01:34:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 417. [2018-11-23 01:34:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-23 01:34:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 450 transitions. [2018-11-23 01:34:43,699 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 450 transitions. Word has length 252 [2018-11-23 01:34:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:43,699 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 450 transitions. [2018-11-23 01:34:43,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:34:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 450 transitions. [2018-11-23 01:34:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-23 01:34:43,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:43,700 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] [2018-11-23 01:34:43,701 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:43,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash -458958765, now seen corresponding path program 1 times [2018-11-23 01:34:43,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:43,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:43,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 01:34:43,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:43,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:34:43,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:34:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:34:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:34:43,838 INFO L87 Difference]: Start difference. First operand 417 states and 450 transitions. Second operand 5 states. [2018-11-23 01:34:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:43,870 INFO L93 Difference]: Finished difference Result 510 states and 545 transitions. [2018-11-23 01:34:43,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:34:43,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 254 [2018-11-23 01:34:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:43,871 INFO L225 Difference]: With dead ends: 510 [2018-11-23 01:34:43,872 INFO L226 Difference]: Without dead ends: 423 [2018-11-23 01:34:43,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:34:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-11-23 01:34:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-11-23 01:34:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 01:34:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 454 transitions. [2018-11-23 01:34:43,892 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 454 transitions. Word has length 254 [2018-11-23 01:34:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:43,892 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 454 transitions. [2018-11-23 01:34:43,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:34:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 454 transitions. [2018-11-23 01:34:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-23 01:34:43,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:43,893 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] [2018-11-23 01:34:43,893 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:43,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 393607698, now seen corresponding path program 1 times [2018-11-23 01:34:43,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:43,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:43,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 01:34:44,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:44,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:34:44,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:34:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:34:44,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:34:44,013 INFO L87 Difference]: Start difference. First operand 421 states and 454 transitions. Second operand 5 states. [2018-11-23 01:34:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:44,055 INFO L93 Difference]: Finished difference Result 574 states and 623 transitions. [2018-11-23 01:34:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:34:44,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 254 [2018-11-23 01:34:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:44,057 INFO L225 Difference]: With dead ends: 574 [2018-11-23 01:34:44,057 INFO L226 Difference]: Without dead ends: 419 [2018-11-23 01:34:44,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:34:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-23 01:34:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-11-23 01:34:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-23 01:34:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 451 transitions. [2018-11-23 01:34:44,077 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 451 transitions. Word has length 254 [2018-11-23 01:34:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:44,077 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 451 transitions. [2018-11-23 01:34:44,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:34:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 451 transitions. [2018-11-23 01:34:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-23 01:34:44,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:44,079 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] [2018-11-23 01:34:44,079 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:44,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1170154758, now seen corresponding path program 1 times [2018-11-23 01:34:44,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:44,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:44,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 01:34:44,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:44,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 01:34:44,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 01:34:44,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 01:34:44,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 01:34:44,335 INFO L87 Difference]: Start difference. First operand 419 states and 451 transitions. Second operand 14 states. [2018-11-23 01:34:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:46,536 INFO L93 Difference]: Finished difference Result 485 states and 533 transitions. [2018-11-23 01:34:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 01:34:46,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 286 [2018-11-23 01:34:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:46,537 INFO L225 Difference]: With dead ends: 485 [2018-11-23 01:34:46,538 INFO L226 Difference]: Without dead ends: 428 [2018-11-23 01:34:46,538 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-11-23 01:34:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-11-23 01:34:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 419. [2018-11-23 01:34:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-23 01:34:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 450 transitions. [2018-11-23 01:34:46,557 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 450 transitions. Word has length 286 [2018-11-23 01:34:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:46,557 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 450 transitions. [2018-11-23 01:34:46,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 01:34:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 450 transitions. [2018-11-23 01:34:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-23 01:34:46,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:46,559 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] [2018-11-23 01:34:46,559 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:46,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash 363029532, now seen corresponding path program 1 times [2018-11-23 01:34:46,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:46,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 01:34:47,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:34:47,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/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-11-23 01:34:47,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:47,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:34:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 01:34:48,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:34:48,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2018-11-23 01:34:48,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 01:34:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 01:34:48,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-11-23 01:34:48,077 INFO L87 Difference]: Start difference. First operand 419 states and 450 transitions. Second operand 27 states. [2018-11-23 01:34:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:48,299 INFO L93 Difference]: Finished difference Result 487 states and 533 transitions. [2018-11-23 01:34:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 01:34:48,299 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 289 [2018-11-23 01:34:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:48,300 INFO L225 Difference]: With dead ends: 487 [2018-11-23 01:34:48,300 INFO L226 Difference]: Without dead ends: 415 [2018-11-23 01:34:48,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-11-23 01:34:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-11-23 01:34:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 400. [2018-11-23 01:34:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-23 01:34:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 424 transitions. [2018-11-23 01:34:48,320 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 424 transitions. Word has length 289 [2018-11-23 01:34:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:48,320 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 424 transitions. [2018-11-23 01:34:48,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 01:34:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 424 transitions. [2018-11-23 01:34:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-23 01:34:48,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:48,321 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] [2018-11-23 01:34:48,322 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:48,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:48,322 INFO L82 PathProgramCache]: Analyzing trace with hash 120703579, now seen corresponding path program 1 times [2018-11-23 01:34:48,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:34:48,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:34:48,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:48,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:48,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 01:34:48,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:34:48,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/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-11-23 01:34:48,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:48,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:34:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 01:34:49,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:34:49,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2018-11-23 01:34:49,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 01:34:49,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 01:34:49,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-11-23 01:34:49,273 INFO L87 Difference]: Start difference. First operand 400 states and 424 transitions. Second operand 27 states. [2018-11-23 01:34:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:49,540 INFO L93 Difference]: Finished difference Result 417 states and 444 transitions. [2018-11-23 01:34:49,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 01:34:49,540 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 294 [2018-11-23 01:34:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:49,541 INFO L225 Difference]: With dead ends: 417 [2018-11-23 01:34:49,541 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 01:34:49,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-11-23 01:34:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 01:34:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 01:34:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 01:34:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 01:34:49,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2018-11-23 01:34:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:49,542 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:34:49,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 01:34:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:34:49,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:34:49,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 01:34:50,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:50,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:50,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:50,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:51,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,257 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-11-23 01:34:52,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:52,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:54,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:54,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:54,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:54,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:54,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,599 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-23 01:34:55,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:55,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:56,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:57,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:58,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:58,921 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-23 01:34:58,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:59,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:59,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:59,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:34:59,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 01:35:00,564 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 51 [2018-11-23 01:35:01,055 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2018-11-23 01:35:01,337 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2018-11-23 01:35:02,267 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2018-11-23 01:35:02,437 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2018-11-23 01:35:02,811 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2018-11-23 01:35:03,210 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2018-11-23 01:35:03,755 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2018-11-23 01:35:04,060 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 53 [2018-11-23 01:35:04,450 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2018-11-23 01:35:04,776 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 48 [2018-11-23 01:35:05,349 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2018-11-23 01:35:05,543 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 26 [2018-11-23 01:35:05,757 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2018-11-23 01:35:07,469 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2018-11-23 01:35:08,289 WARN L180 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-11-23 01:35:08,428 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2018-11-23 01:35:08,905 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 43 [2018-11-23 01:35:09,113 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 1 [2018-11-23 01:35:09,506 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-11-23 01:35:09,657 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2018-11-23 01:35:10,293 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 67 [2018-11-23 01:35:10,684 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 67 [2018-11-23 01:35:11,083 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2018-11-23 01:35:11,245 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 1 [2018-11-23 01:35:11,596 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 52 [2018-11-23 01:35:12,072 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 56 [2018-11-23 01:35:12,283 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2018-11-23 01:35:12,645 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2018-11-23 01:35:13,013 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2018-11-23 01:35:13,394 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 68 [2018-11-23 01:35:13,542 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 34 [2018-11-23 01:35:13,713 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2018-11-23 01:35:14,561 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2018-11-23 01:35:14,766 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2018-11-23 01:35:14,904 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2018-11-23 01:35:15,335 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 68 [2018-11-23 01:35:15,775 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 31 [2018-11-23 01:35:15,902 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2018-11-23 01:35:16,463 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 51 [2018-11-23 01:35:16,686 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2018-11-23 01:35:16,867 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2018-11-23 01:35:17,526 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 48 [2018-11-23 01:35:17,920 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 43 [2018-11-23 01:35:18,219 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2018-11-23 01:35:18,276 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 21513 21528) no Hoare annotation was computed. [2018-11-23 01:35:18,276 INFO L451 ceAbstractionStarter]: At program point IoGetConfigurationInformationENTRY(lines 21513 21528) the Hoare annotation is: true [2018-11-23 01:35:18,276 INFO L451 ceAbstractionStarter]: At program point L21521(line 21521) the Hoare annotation is: true [2018-11-23 01:35:18,276 INFO L448 ceAbstractionStarter]: For program point L21521-1(line 21521) no Hoare annotation was computed. [2018-11-23 01:35:18,276 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 21513 21528) no Hoare annotation was computed. [2018-11-23 01:35:18,276 INFO L444 ceAbstractionStarter]: At program point L20825(line 20825) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,276 INFO L444 ceAbstractionStarter]: At program point L20788(lines 20787 20831) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,276 INFO L448 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 20605 20871) no Hoare annotation was computed. [2018-11-23 01:35:18,276 INFO L448 ceAbstractionStarter]: For program point L20784(lines 20784 20832) no Hoare annotation was computed. [2018-11-23 01:35:18,276 INFO L448 ceAbstractionStarter]: For program point L20846(lines 20846 20853) no Hoare annotation was computed. [2018-11-23 01:35:18,276 INFO L444 ceAbstractionStarter]: At program point L20846-2(lines 20846 20853) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,276 INFO L448 ceAbstractionStarter]: For program point L20801-1(line 20801) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L444 ceAbstractionStarter]: At program point L20801(line 20801) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point L20735(lines 20735 20753) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point L20764(lines 20764 20835) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point L20735-2(lines 20735 20753) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point L20731-1(line 20731) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L444 ceAbstractionStarter]: At program point L20731(line 20731) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point L20707(lines 20707 20711) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L444 ceAbstractionStarter]: At program point L20785(lines 20781 20833) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point L20781(lines 20781 20833) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point $Ultimate##23(lines 20792 20829) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point L20843-1(line 20843) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 20792 20829) no Hoare annotation was computed. [2018-11-23 01:35:18,277 INFO L444 ceAbstractionStarter]: At program point L20843(line 20843) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,277 INFO L444 ceAbstractionStarter]: At program point L20864(lines 20690 20865) the Hoare annotation is: (let ((.cse8 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse9 (= |old(~compRegistered~0)| 0)) (.cse12 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse1 (= FloppyProcessQueuedRequests_~__cil_tmp17~27 0)) (.cse2 (= FloppyProcessQueuedRequests_~headOfList~0.offset 0)) (.cse4 (= 1 ~s~0)) (.cse5 (= FloppyProcessQueuedRequests_~headOfList~0.base 0)) (.cse6 (= ~PagingReferenceCount~0 1)) (.cse7 (or .cse8 .cse10 .cse9 .cse12)) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or (and .cse0 (= ~customIrp~0 |old(~customIrp~0)|) .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) .cse7) (or (and .cse0 .cse3 .cse1 (= 0 ~customIrp~0) .cse2 .cse4 .cse5 .cse6) .cse8 (not .cse9) .cse10 .cse11 .cse12) (or (= 0 ~myStatus~0) .cse7 (not (= |old(~myStatus~0)| 0)) .cse11) (or (not (= |old(~setEventCalled~0)| 1)) .cse8 .cse10 (= 1 ~setEventCalled~0) .cse9 .cse12)))) [2018-11-23 01:35:18,277 INFO L444 ceAbstractionStarter]: At program point FloppyProcessQueuedRequestsENTRY(lines 20605 20871) 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 (= ~PagingReferenceCount~0 1)) (.cse4 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse2) (= ~s~0 |old(~s~0)|) .cse3)) (or .cse0 (= 0 ~myStatus~0) (not (= |old(~myStatus~0)| 0)) .cse4) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 (= 1 ~setEventCalled~0) .cse7 .cse8) (or (and .cse1 .cse2 (= 0 ~customIrp~0) (= 1 ~s~0) .cse3) .cse5 (not .cse7) .cse6 .cse4 .cse8)))) [2018-11-23 01:35:18,277 INFO L444 ceAbstractionStarter]: At program point L20691-2(lines 20691 20863) the Hoare annotation is: (let ((.cse6 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (= |old(~compRegistered~0)| 0)) (.cse9 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse6 .cse7 .cse8 .cse9)) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= 1 ~s~0)) (.cse5 (= ~PagingReferenceCount~0 1)) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (= 0 ~myStatus~0) .cse1) (or (and .cse2 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse3) .cse4 .cse5) .cse0) (or (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (= 1 ~setEventCalled~0) .cse8 .cse9) (or (and .cse2 .cse3 (= 0 ~customIrp~0) .cse4 .cse5) .cse6 (not .cse8) .cse7 .cse1 .cse9)))) [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L20811-1(line 20811) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L444 ceAbstractionStarter]: At program point L20811(line 20811) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L20758(lines 20758 20840) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L444 ceAbstractionStarter]: At program point L20791(lines 20790 20830) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L20692(line 20692) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L444 ceAbstractionStarter]: At program point L20758-1(lines 20691 20863) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L20787(lines 20787 20831) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L444 ceAbstractionStarter]: At program point L20700(line 20700) the Hoare annotation is: (let ((.cse6 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (= |old(~compRegistered~0)| 0)) (.cse9 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse6 .cse7 .cse8 .cse9)) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= 1 ~s~0)) (.cse5 (= ~PagingReferenceCount~0 1)) (.cse1 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (= 0 ~myStatus~0) .cse1) (or (and .cse2 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse3) .cse4 .cse5) .cse0) (or (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (= 1 ~setEventCalled~0) .cse8 .cse9) (or (and .cse2 .cse3 (= 0 ~customIrp~0) .cse4 .cse5) .cse6 (not .cse8) .cse7 .cse1 .cse9)))) [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L20700-1(line 20700) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L20841(lines 20841 20859) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L444 ceAbstractionStarter]: At program point L20775(line 20775) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 20605 20871) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L20849-1(line 20849) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L444 ceAbstractionStarter]: At program point L20849(line 20849) the Hoare annotation is: (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (= |old(~compRegistered~0)| 0) .cse2) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L7616-2(lines 7616 7628) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L7616(lines 7616 7628) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L7864(line 7864) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L444 ceAbstractionStarter]: At program point L7154loopEntry(lines 7154 7157) 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-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L7220(lines 7220 7930) no Hoare annotation was computed. [2018-11-23 01:35:18,278 INFO L448 ceAbstractionStarter]: For program point L7633-1(line 7633) no Hoare annotation was computed. [2018-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7633(line 7633) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (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 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (and (= 0 FloppyPnp_~ntStatus~3) (and .cse0 (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184)) .cse1 .cse2 .cse3 (<= 112 FloppyPnp_~__cil_tmp164~2) (<= (div FloppyPnp_~__cil_tmp164~2 4294967296) 0)) (= 0 ~myStatus~0) (= 0 ~customIrp~0)))) [2018-11-23 01:35:18,279 INFO L448 ceAbstractionStarter]: For program point L7336(lines 7336 7433) no Hoare annotation was computed. [2018-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7881(lines 7240 7921) 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-11-23 01:35:18,279 INFO L448 ceAbstractionStarter]: For program point L7204-1(line 7204) no Hoare annotation was computed. [2018-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7204(line 7204) 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-11-23 01:35:18,279 INFO L448 ceAbstractionStarter]: For program point L7749-1(lines 7745 7751) no Hoare annotation was computed. [2018-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7749(line 7749) 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-11-23 01:35:18,279 INFO L448 ceAbstractionStarter]: For program point L7254(lines 7254 7270) no Hoare annotation was computed. [2018-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7552(line 7552) 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-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7453loopEntry(lines 7453 7456) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7734(line 7734) 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-11-23 01:35:18,279 INFO L448 ceAbstractionStarter]: For program point L7734-1(line 7734) no Hoare annotation was computed. [2018-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7239(lines 7238 7924) 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-11-23 01:35:18,279 INFO L448 ceAbstractionStarter]: For program point L7173(line 7173) no Hoare annotation was computed. [2018-11-23 01:35:18,279 INFO L448 ceAbstractionStarter]: For program point L7223(lines 7223 7929) no Hoare annotation was computed. [2018-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7256loopEntry(lines 7256 7259) 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-11-23 01:35:18,279 INFO L444 ceAbstractionStarter]: At program point L7851(line 7851) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,280 INFO L444 ceAbstractionStarter]: At program point L7653(line 7653) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (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 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (and (= 0 FloppyPnp_~ntStatus~3) (and .cse0 (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184)) .cse1 .cse2 .cse3 (<= 112 FloppyPnp_~__cil_tmp164~2) (<= (div FloppyPnp_~__cil_tmp164~2 4294967296) 0)) (= 0 ~myStatus~0) (= 0 ~customIrp~0)))) [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7934(line 7934) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L444 ceAbstractionStarter]: At program point L7802(line 7802) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,280 INFO L444 ceAbstractionStarter]: At program point L7158(lines 7153 7159) 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-11-23 01:35:18,280 INFO L444 ceAbstractionStarter]: At program point L7224(lines 7220 7930) 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-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7802-1(line 7802) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7472(lines 7472 7478) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L444 ceAbstractionStarter]: At program point L7786(line 7786) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 01:35:18,280 INFO L444 ceAbstractionStarter]: At program point L7720(lines 7715 7721) 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-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7786-1(line 7786) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7555-1(lines 7550 7563) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7555(lines 7555 7562) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7836-1(lines 7836 7855) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7357-1(lines 7357 7368) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7836(lines 7836 7855) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7357(lines 7357 7368) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7192(lines 7192 7209) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L448 ceAbstractionStarter]: For program point L7919-1(line 7919) no Hoare annotation was computed. [2018-11-23 01:35:18,280 INFO L444 ceAbstractionStarter]: At program point L7919(line 7919) 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-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7622(lines 7622 7623) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184))) (.cse2 (= 0 ~customIrp~0)) (.cse3 (= 0 ~myStatus~0)) (.cse4 (not (= 0 ~compRegistered~0))) (.cse5 (= 1 ~setEventCalled~0)) (.cse6 (= ~PagingReferenceCount~0 1)) (.cse7 (<= FloppyPnp_~ntStatus~3 259)) (.cse8 (<= 259 FloppyPnp_~ntStatus~3)) (.cse9 (or (and (<= 0 (+ FloppyPnp_~__cil_tmp164~2 2147483648)) (<= (+ FloppyPnp_~__cil_tmp164~2 1) 0)) (<= 112 FloppyPnp_~__cil_tmp164~2))) (.cse10 (<= (div FloppyPnp_~__cil_tmp164~2 4294967296) 0))) (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 .cse2 .cse3 (= 6 ~s~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 1 ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point L7622-1(lines 7622 7623) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7457(lines 7443 7459) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 6728 7950) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point L7226(lines 7226 7928) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point L7325-1(line 7325) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7325(line 7325) 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-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point L7887-1(lines 7883 7889) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7887(line 7887) 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-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point L7243(line 7243) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7557(line 7557) 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-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7937-2(lines 7937 7944) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (= ~s~0 4)) (.cse5 (= 2 ~s~0)) (.cse4 (not (= FloppyPnp_~ntStatus~3 259))) (.cse6 (= 0 ~pended~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse8 (= 1 ~setEventCalled~0)) (.cse7 (= 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .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 .cse6 .cse0 .cse1 .cse3 .cse7) (and .cse6 .cse1 .cse2 .cse8 .cse3 .cse7) (and (and .cse6 .cse5 .cse7) .cse4) (and (and .cse6 (not .cse0) .cse8 .cse7) (= 6 ~s~0)))) [2018-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point L7937(lines 7937 7944) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point L7161(line 7161) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point L7508-1(line 7508) no Hoare annotation was computed. [2018-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7508(line 7508) 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-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7541-1(line 7541) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184)) (= 0 ~customIrp~0) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1) (<= 112 FloppyPnp_~__cil_tmp164~2) (<= (div FloppyPnp_~__cil_tmp164~2 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)|)))) [2018-11-23 01:35:18,281 INFO L444 ceAbstractionStarter]: At program point L7541(line 7541) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184)) (= 0 ~customIrp~0) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1) (<= 112 FloppyPnp_~__cil_tmp164~2) (<= (div FloppyPnp_~__cil_tmp164~2 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)|)))) [2018-11-23 01:35:18,281 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 6728 7950) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L444 ceAbstractionStarter]: At program point L7822(line 7822) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7277(lines 7277 7319) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7822-1(line 7822) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L444 ceAbstractionStarter]: At program point L7806(line 7806) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7806-1(line 7806) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7542(line 7542) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L444 ceAbstractionStarter]: At program point L7641-1(line 7641) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (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 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (and (= 0 FloppyPnp_~ntStatus~3) (and .cse0 (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184)) .cse1 .cse2 .cse3 (<= 112 FloppyPnp_~__cil_tmp164~2) (<= (div FloppyPnp_~__cil_tmp164~2 4294967296) 0)) (= 0 ~myStatus~0) (= 0 ~customIrp~0)))) [2018-11-23 01:35:18,282 INFO L444 ceAbstractionStarter]: At program point L7641(line 7641) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (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 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (and (= 0 FloppyPnp_~ntStatus~3) (and .cse0 (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184)) .cse1 .cse2 .cse3 (<= 112 FloppyPnp_~__cil_tmp164~2) (<= (div FloppyPnp_~__cil_tmp164~2 4294967296) 0)) (= 0 ~myStatus~0) (= 0 ~customIrp~0)))) [2018-11-23 01:35:18,282 INFO L444 ceAbstractionStarter]: At program point L7922(lines 7240 7923) the Hoare annotation is: (let ((.cse2 (= ~PagingReferenceCount~0 1)) (.cse0 (= 0 ~pended~0)) (.cse5 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (.cse7 (= 0 ~customIrp~0)) (.cse6 (= ~s~0 4)) (.cse1 (= 0 ~compRegistered~0)) (.cse3 (not (= FloppyPnp_~ntStatus~3 259))) (.cse4 (= 2 ~s~0)) (.cse8 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)))) (or (and (= 6 ~s~0) (and .cse0 (not .cse1) (= 1 ~setEventCalled~0) .cse2)) (and .cse0 .cse1 .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 .cse3 (and .cse0 .cse4 .cse2)) (and .cse0 .cse1 .cse5 .cse2 .cse6) (and .cse0 .cse1 .cse5 .cse7 .cse6) (and .cse1 .cse5 .cse7 .cse8 .cse6) (and .cse1 .cse3 .cse4 .cse8))) [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7443(lines 7443 7459) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7476-1(lines 7472 7478) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L444 ceAbstractionStarter]: At program point L7476(line 7476) 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-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7278(lines 7278 7284) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7642(line 7642) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7675(lines 7675 7681) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7229(lines 7229 7927) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 7240 7923) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 7240 7923) no Hoare annotation was computed. [2018-11-23 01:35:18,282 INFO L448 ceAbstractionStarter]: For program point L7940-1(line 7940) no Hoare annotation was computed. [2018-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7940(line 7940) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (= ~s~0 4)) (.cse5 (= 2 ~s~0)) (.cse4 (not (= FloppyPnp_~ntStatus~3 259))) (.cse6 (= 0 ~pended~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse8 (= 1 ~setEventCalled~0)) (.cse7 (= 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .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 .cse6 .cse0 .cse1 .cse3 .cse7) (and .cse6 .cse1 .cse2 .cse8 .cse3 .cse7) (and (and .cse6 .cse5 .cse7) .cse4) (and (and .cse6 (not .cse0) .cse8 .cse7) (= 6 ~s~0)))) [2018-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7230(lines 7226 7928) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,283 INFO L448 ceAbstractionStarter]: For program point L7841-1(line 7841) no Hoare annotation was computed. [2018-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7841(line 7841) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7164-1(lines 7164 7171) 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-11-23 01:35:18,283 INFO L448 ceAbstractionStarter]: For program point L7164(lines 7164 7171) no Hoare annotation was computed. [2018-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7346(lines 7346 7347) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= 0 ~customIrp~0)) (.cse2 (<= FloppyPnp_~ntStatus~3 259)) (.cse3 (<= 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 (= 0 ~pended~0) .cse0 (= 1 ~s~0) .cse1 .cse2 .cse3) (and .cse0 (= ~s~0 |old(~s~0)|) .cse1 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) .cse2 .cse3))) [2018-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7445loopEntry(lines 7445 7448) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7726(line 7726) 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-11-23 01:35:18,283 INFO L448 ceAbstractionStarter]: For program point L7346-1(lines 7346 7347) no Hoare annotation was computed. [2018-11-23 01:35:18,283 INFO L448 ceAbstractionStarter]: For program point L7726-1(line 7726) no Hoare annotation was computed. [2018-11-23 01:35:18,283 INFO L448 ceAbstractionStarter]: For program point L7743-1(lines 7240 7921) no Hoare annotation was computed. [2018-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7743(line 7743) 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-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7264loopEntry(lines 7264 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) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 01:35:18,283 INFO L444 ceAbstractionStarter]: At program point L7314(line 7314) 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-11-23 01:35:18,283 INFO L448 ceAbstractionStarter]: For program point L7380(lines 7380 7386) no Hoare annotation was computed. [2018-11-23 01:35:18,283 INFO L448 ceAbstractionStarter]: For program point L7314-1(line 7314) no Hoare annotation was computed. [2018-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7364(line 7364) 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 (and (= 0 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .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)|))))) [2018-11-23 01:35:18,284 INFO L448 ceAbstractionStarter]: For program point L7711-1(line 7711) no Hoare annotation was computed. [2018-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7711(line 7711) 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-11-23 01:35:18,284 INFO L448 ceAbstractionStarter]: For program point L7232(lines 7232 7926) no Hoare annotation was computed. [2018-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7282(line 7282) 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-11-23 01:35:18,284 INFO L448 ceAbstractionStarter]: For program point L7282-1(lines 7278 7284) no Hoare annotation was computed. [2018-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7431(line 7431) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (not (= FloppyPnp_~ntStatus~3 259))) (.cse2 (= 1 ~s~0))) (or (and (= 0 ~pended~0) .cse0 .cse1 .cse2) (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)|))))) [2018-11-23 01:35:18,284 INFO L448 ceAbstractionStarter]: For program point L7679-1(lines 7675 7681) no Hoare annotation was computed. [2018-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7167(line 7167) 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-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7679(line 7679) 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-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7233(lines 7232 7926) 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-11-23 01:35:18,284 INFO L448 ceAbstractionStarter]: For program point L7828-1(line 7828) no Hoare annotation was computed. [2018-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7828(line 7828) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,284 INFO L448 ceAbstractionStarter]: For program point L7217(lines 7217 7931) no Hoare annotation was computed. [2018-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7333-1(line 7333) 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-11-23 01:35:18,284 INFO L444 ceAbstractionStarter]: At program point L7812(line 7812) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,284 INFO L448 ceAbstractionStarter]: For program point L7845-1(line 7845) no Hoare annotation was computed. [2018-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7333(line 7333) 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-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7845(line 7845) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7614(line 7614) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184)) (= 0 ~customIrp~0) (= 0 ~myStatus~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1) (<= 112 FloppyPnp_~__cil_tmp164~2) (<= (div FloppyPnp_~__cil_tmp164~2 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)|)))) [2018-11-23 01:35:18,285 INFO L448 ceAbstractionStarter]: For program point L7548-1(lines 7510 7655) no Hoare annotation was computed. [2018-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7548(line 7548) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 0 (+ FloppyPnp_~__cil_tmp164~2 (* 4294967296 (div (+ (- FloppyPnp_~__cil_tmp164~2) (- 4294967184)) 4294967296)) 4294967184)) (= 0 ~customIrp~0) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1) (<= 112 FloppyPnp_~__cil_tmp164~2) (<= (div FloppyPnp_~__cil_tmp164~2 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)|)))) [2018-11-23 01:35:18,285 INFO L448 ceAbstractionStarter]: For program point L7614-1(line 7614) no Hoare annotation was computed. [2018-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7862(line 7862) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,285 INFO L448 ceAbstractionStarter]: For program point L7416-1(line 7416) no Hoare annotation was computed. [2018-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7416(line 7416) 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 (= 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 .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) .cse3 .cse4))) [2018-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7218(lines 7217 7931) 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-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7862-1(line 7862) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7664(lines 7659 7665) 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-11-23 01:35:18,285 INFO L448 ceAbstractionStarter]: For program point L7466(lines 7466 7655) no Hoare annotation was computed. [2018-11-23 01:35:18,285 INFO L448 ceAbstractionStarter]: For program point L7334(line 7334) no Hoare annotation was computed. [2018-11-23 01:35:18,285 INFO L448 ceAbstractionStarter]: For program point L7235(lines 7235 7925) no Hoare annotation was computed. [2018-11-23 01:35:18,285 INFO L444 ceAbstractionStarter]: At program point L7268(lines 7254 7270) 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-11-23 01:35:18,285 INFO L448 ceAbstractionStarter]: For program point L7384-1(lines 7380 7386) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L444 ceAbstractionStarter]: At program point L7863(line 7863) 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) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-11-23 01:35:18,286 INFO L444 ceAbstractionStarter]: At program point L7384(line 7384) 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-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L7797-1(lines 7797 7816) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L7797(lines 7797 7816) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L7946(line 7946) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 6728 7950) 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-11-23 01:35:18,286 INFO L444 ceAbstractionStarter]: At program point L7236(lines 7235 7925) 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-11-23 01:35:18,286 INFO L444 ceAbstractionStarter]: At program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= 1 ~s~0))) (let ((.cse6 (and .cse0 .cse1 .cse2)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (= 0 |old(~pended~0)|))) (.cse5 (not (= 1 |old(~s~0)|)))) (and (or (and .cse0 .cse1 (= 0 ~customIrp~0) .cse2 (= 0 ~PagingReferenceCount~0)) (or (not (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) .cse5)) (or .cse3 .cse4 .cse6 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse5) (or .cse6 (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse3 (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|)) .cse4 .cse5) (or .cse6 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse3 .cse4 .cse5)))) [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L444 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: (let ((.cse0 (not (= |old(~compRegistered~0)| 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) .cse0 (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|)) .cse1 .cse2) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 .cse2) (or (not (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) .cse2) (or .cse0 .cse1 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse2))) [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L444 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (let ((.cse0 (not (= |old(~compRegistered~0)| 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (or (not (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) .cse2)) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 .cse2) (or (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|)) .cse1 .cse2) (or .cse0 .cse1 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse2))) [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L-1-8(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L444 ceAbstractionStarter]: At program point L-1-9(line -1) the Hoare annotation is: (let ((.cse0 (not (= |old(~compRegistered~0)| 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) .cse2) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 .cse2) (or (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|)) .cse1 .cse2) (or (not (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) .cse2))) [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,286 INFO L448 ceAbstractionStarter]: For program point L-1-12(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,287 INFO L444 ceAbstractionStarter]: At program point L-1-13(line -1) the Hoare annotation is: (let ((.cse0 (not (= |old(~compRegistered~0)| 0))) (.cse1 (not (= 0 |old(~pended~0)|))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 .cse2) (or (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|)) .cse1 .cse2) (or (not (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) .cse2) (or .cse0 .cse1 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse2))) [2018-11-23 01:35:18,287 INFO L448 ceAbstractionStarter]: For program point L-1-14(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,287 INFO L444 ceAbstractionStarter]: At program point L-1-16(line -1) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= 1 ~s~0)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (= 0 |old(~pended~0)|))) (.cse5 (not (= 1 |old(~s~0)|)))) (and (or (and .cse0 .cse1 .cse2 (not (= |#funAddr~FloppyPnp.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|)) .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) .cse5)) (or (and .cse0 .cse1 .cse2 (not (= |#funAddr~FloppyDeviceControl.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|))) .cse3 .cse4 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse5) (or (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse3 (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|)) .cse4 .cse5) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5))) [2018-11-23 01:35:18,287 INFO L448 ceAbstractionStarter]: For program point L-1-17(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,287 INFO L448 ceAbstractionStarter]: For program point L-1-18(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,287 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,287 INFO L444 ceAbstractionStarter]: At program point L21077(lines 21070 21142) the Hoare annotation is: (let ((.cse3 (= 2 ~s~0)) (.cse7 (not (= 259 main_~status~4))) (.cse8 (= main_~status~4 ~lowerDriverReturn~0)) (.cse10 (= ~s~0 4)) (.cse11 (= 0 ~customIrp~0)) (.cse1 (not (= main_~__BLAST_NONDET~0 2))) (.cse2 (= 0 ~pended~0)) (.cse4 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~28.base)) (.cse0 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~28.offset)) (.cse9 (= 0 ~compRegistered~0)) (.cse5 (= main_~__cil_tmp14~25 1)) (.cse12 (= 1 ~setEventCalled~0)) (.cse6 (= 0 ~PagingReferenceCount~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse8 (and .cse0 .cse1 .cse9 .cse4 .cse10) .cse11 .cse5) (and (and .cse9 .cse3) .cse7) (and .cse8 .cse2 .cse9 .cse10) (= 0 ~s~0) (and .cse8 (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse10 .cse6) .cse11 .cse5) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse4 .cse0 (not .cse9) (= 6 ~s~0) .cse5 .cse12 .cse6) (not (= 0 |old(~pended~0)|)) (= 1 ~s~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 01:35:18,287 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20933 21146) no Hoare annotation was computed. [2018-11-23 01:35:18,287 INFO L444 ceAbstractionStarter]: At program point L21085(lines 21078 21141) the Hoare annotation is: (let ((.cse10 (= 2 ~s~0)) (.cse11 (not (= 259 main_~status~4))) (.cse8 (= main_~status~4 ~lowerDriverReturn~0)) (.cse4 (= ~s~0 4)) (.cse1 (not (= main_~__BLAST_NONDET~0 2))) (.cse5 (= 0 ~pended~0)) (.cse3 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~28.base)) (.cse0 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~28.offset)) (.cse2 (= 0 ~compRegistered~0)) (.cse9 (= main_~__cil_tmp14~25 1)) (.cse6 (= 1 ~setEventCalled~0)) (.cse7 (= 0 ~PagingReferenceCount~0))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6 .cse4 .cse7)) .cse8 (= 0 ~customIrp~0) .cse9) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (and .cse2 .cse10) .cse11) (and (and .cse0 .cse1 .cse5 .cse10 .cse3 .cse9 .cse7) .cse11) (and .cse8 .cse5 .cse2 .cse4) (= 0 ~s~0) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse5 .cse3 .cse0 (not .cse2) (= 6 ~s~0) .cse9 .cse6 .cse7) (not (= 0 |old(~pended~0)|)) (= 1 ~s~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 01:35:18,291 INFO L448 ceAbstractionStarter]: For program point L21094(lines 21094 21098) no Hoare annotation was computed. [2018-11-23 01:35:18,291 INFO L448 ceAbstractionStarter]: For program point L21003(lines 21003 21057) no Hoare annotation was computed. [2018-11-23 01:35:18,291 INFO L448 ceAbstractionStarter]: For program point L21111(lines 21111 21130) no Hoare annotation was computed. [2018-11-23 01:35:18,291 INFO L448 ceAbstractionStarter]: For program point L21012(lines 21012 21054) no Hoare annotation was computed. [2018-11-23 01:35:18,291 INFO L448 ceAbstractionStarter]: For program point L21045-1(line 21045) no Hoare annotation was computed. [2018-11-23 01:35:18,291 INFO L444 ceAbstractionStarter]: At program point L21045(line 21045) 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)) (and (not (= main_~__BLAST_NONDET~0 2)) (= |#funAddr~FloppyPower.offset| main_~__cil_tmp19~30.offset) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= |#funAddr~FloppyPower.base| main_~__cil_tmp19~30.base)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 01:35:18,291 INFO L444 ceAbstractionStarter]: At program point L21062(line 21062) the Hoare annotation is: (let ((.cse3 (= 2 ~s~0)) (.cse7 (not (= 259 main_~status~4))) (.cse8 (= 0 ~compRegistered~0)) (.cse10 (= main_~status~4 ~lowerDriverReturn~0)) (.cse0 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~28.offset)) (.cse1 (not (= main_~__BLAST_NONDET~0 2))) (.cse2 (= 0 ~pended~0)) (.cse4 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~28.base)) (.cse9 (= 1 ~setEventCalled~0)) (.cse11 (= ~s~0 4)) (.cse6 (= 0 ~PagingReferenceCount~0)) (.cse12 (= 0 ~customIrp~0)) (.cse5 (= main_~__cil_tmp14~25 1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (and .cse1 .cse2 .cse4 .cse0 (= 6 ~s~0) (not .cse8) .cse9 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse10 (and .cse0 .cse1 .cse8 .cse4 .cse11) .cse12 .cse5) (and (and .cse8 .cse3) .cse7) (and .cse10 .cse2 .cse8 .cse11) (and .cse10 (and .cse0 .cse1 .cse2 .cse4 .cse9 .cse11 .cse6) .cse12 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= 1 ~s~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 01:35:18,291 INFO L444 ceAbstractionStarter]: At program point L21103(lines 21092 21132) the Hoare annotation is: (let ((.cse1 (= 2 ~s~0)) (.cse2 (not (= 259 main_~status~4))) (.cse10 (= ~s~0 4)) (.cse3 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~28.offset)) (.cse4 (not (= main_~__BLAST_NONDET~0 2))) (.cse5 (= 0 ~pended~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse6 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~28.base)) (.cse8 (= 0 ~PagingReferenceCount~0)) (.cse9 (= main_~status~4 ~lowerDriverReturn~0)) (.cse7 (= main_~__cil_tmp14~25 1))) (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and (and .cse0 .cse1) .cse2) (and (and .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 .cse8) .cse2) (and .cse9 .cse5 .cse0 .cse10) (and (or (and .cse3 .cse4 .cse0 .cse6 .cse10) (and .cse3 .cse4 .cse5 (not (= 6 ~s~0)) (not (= ~s~0 2)) (not .cse0) .cse6 (= 1 ~setEventCalled~0) .cse8)) .cse9 (= 0 ~customIrp~0) .cse7) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 01:35:18,301 INFO L444 ceAbstractionStarter]: At program point L21004(lines 21003 21057) 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-11-23 01:35:18,301 INFO L448 ceAbstractionStarter]: For program point L21079(lines 21079 21083) no Hoare annotation was computed. [2018-11-23 01:35:18,301 INFO L448 ceAbstractionStarter]: For program point L21112(lines 21112 21118) no Hoare annotation was computed. [2018-11-23 01:35:18,301 INFO L448 ceAbstractionStarter]: For program point L20980(lines 20980 20988) no Hoare annotation was computed. [2018-11-23 01:35:18,302 INFO L444 ceAbstractionStarter]: At program point L21013(lines 21012 21054) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= main_~__BLAST_NONDET~0 2)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 01:35:18,302 INFO L444 ceAbstractionStarter]: At program point L20980-2(lines 20980 20988) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= 0 ~customIrp~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 01:35:18,302 INFO L448 ceAbstractionStarter]: For program point L21021-1(line 21021) no Hoare annotation was computed. [2018-11-23 01:35:18,302 INFO L444 ceAbstractionStarter]: At program point L21021(line 21021) 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)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= |#funAddr~FloppyCreateClose.offset| main_~__cil_tmp15~27.offset)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 01:35:18,302 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 21017 21052) no Hoare annotation was computed. [2018-11-23 01:35:18,302 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20933 21146) no Hoare annotation was computed. [2018-11-23 01:35:18,302 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 21017 21052) no Hoare annotation was computed. [2018-11-23 01:35:18,302 INFO L448 ceAbstractionStarter]: For program point L21071(lines 21071 21075) no Hoare annotation was computed. [2018-11-23 01:35:18,302 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 20933 21146) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 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-11-23 01:35:18,307 INFO L448 ceAbstractionStarter]: For program point L21088(lines 21088 21139) no Hoare annotation was computed. [2018-11-23 01:35:18,307 INFO L448 ceAbstractionStarter]: For program point L21088-1(lines 21070 21142) no Hoare annotation was computed. [2018-11-23 01:35:18,307 INFO L448 ceAbstractionStarter]: For program point L20965-1(line 20965) no Hoare annotation was computed. [2018-11-23 01:35:18,307 INFO L444 ceAbstractionStarter]: At program point L20965(line 20965) 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-11-23 01:35:18,307 INFO L448 ceAbstractionStarter]: For program point L21122(lines 21122 21128) no Hoare annotation was computed. [2018-11-23 01:35:18,307 INFO L448 ceAbstractionStarter]: For program point L21105(lines 21105 21109) no Hoare annotation was computed. [2018-11-23 01:35:18,307 INFO L448 ceAbstractionStarter]: For program point L21006(lines 21006 21056) no Hoare annotation was computed. [2018-11-23 01:35:18,307 INFO L448 ceAbstractionStarter]: For program point L21039-1(line 21039) no Hoare annotation was computed. [2018-11-23 01:35:18,307 INFO L444 ceAbstractionStarter]: At program point L21039(line 21039) 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)) (and (not (= main_~__BLAST_NONDET~0 2)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~28.base) (= 0 ~customIrp~0) (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~28.offset) (= 1 ~s~0) (= main_~__cil_tmp14~25 1) (= 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 01:35:18,307 INFO L448 ceAbstractionStarter]: For program point L20990(line 20990) no Hoare annotation was computed. [2018-11-23 01:35:18,307 INFO L444 ceAbstractionStarter]: At program point L21114(line 21114) 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-11-23 01:35:18,307 INFO L444 ceAbstractionStarter]: At program point L21007(lines 21006 21056) 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)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= main_~__cil_tmp14~25 1) (< 0 (+ main_~status~4 1))) (not (= |old(~customIrp~0)| 0))) [2018-11-23 01:35:18,307 INFO L451 ceAbstractionStarter]: At program point L21016(lines 21015 21053) the Hoare annotation is: true [2018-11-23 01:35:18,308 INFO L448 ceAbstractionStarter]: For program point L21000(lines 21000 21058) no Hoare annotation was computed. [2018-11-23 01:35:18,308 INFO L448 ceAbstractionStarter]: For program point L21033-1(line 21033) no Hoare annotation was computed. [2018-11-23 01:35:18,308 INFO L444 ceAbstractionStarter]: At program point L21033(line 21033) the Hoare annotation is: (or (and (= |#funAddr~FloppyDeviceControl.offset| main_~__cil_tmp17~28.offset) (= |#funAddr~FloppyDeviceControl.base| main_~__cil_tmp17~28.base) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= main_~__cil_tmp14~25 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-11-23 01:35:18,313 INFO L448 ceAbstractionStarter]: For program point L20967-1(lines 20960 21145) no Hoare annotation was computed. [2018-11-23 01:35:18,313 INFO L448 ceAbstractionStarter]: For program point L20967(lines 20967 21069) no Hoare annotation was computed. [2018-11-23 01:35:18,313 INFO L448 ceAbstractionStarter]: For program point L21091(lines 21091 21135) no Hoare annotation was computed. [2018-11-23 01:35:18,313 INFO L444 ceAbstractionStarter]: At program point L21124(line 21124) 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-11-23 01:35:18,313 INFO L444 ceAbstractionStarter]: At program point L21001(lines 21000 21058) 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-11-23 01:35:18,313 INFO L448 ceAbstractionStarter]: For program point L21092(lines 21092 21132) no Hoare annotation was computed. [2018-11-23 01:35:18,313 INFO L448 ceAbstractionStarter]: For program point L21009(lines 21009 21055) no Hoare annotation was computed. [2018-11-23 01:35:18,314 INFO L444 ceAbstractionStarter]: At program point L21010(lines 21009 21055) 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 (not (= main_~__BLAST_NONDET~0 2)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= 0 ~customIrp~0) (= 1 ~s~0) (= main_~__cil_tmp14~25 1) (= 0 ~PagingReferenceCount~0))) [2018-11-23 01:35:18,314 INFO L444 ceAbstractionStarter]: At program point L21051(lines 20967 21067) the Hoare annotation is: (let ((.cse3 (= 2 ~s~0)) (.cse7 (not (= 259 main_~status~4))) (.cse8 (= 0 ~compRegistered~0)) (.cse10 (= main_~status~4 ~lowerDriverReturn~0)) (.cse0 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~28.offset)) (.cse1 (not (= main_~__BLAST_NONDET~0 2))) (.cse2 (= 0 ~pended~0)) (.cse4 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~28.base)) (.cse9 (= 1 ~setEventCalled~0)) (.cse11 (= ~s~0 4)) (.cse6 (= 0 ~PagingReferenceCount~0)) (.cse12 (= 0 ~customIrp~0)) (.cse5 (= main_~__cil_tmp14~25 1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (and .cse1 .cse2 .cse4 .cse0 (= 6 ~s~0) (not .cse8) .cse9 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse10 (and .cse0 .cse1 .cse8 .cse4 .cse11) .cse12 .cse5) (and (and .cse8 .cse3) .cse7) (and .cse10 .cse2 .cse8 .cse11) (and .cse10 (and .cse0 .cse1 .cse2 .cse4 .cse9 .cse11 .cse6) .cse12 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= 1 ~s~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 01:35:18,314 INFO L448 ceAbstractionStarter]: For program point L21093(lines 21093 21101) no Hoare annotation was computed. [2018-11-23 01:35:18,314 INFO L448 ceAbstractionStarter]: For program point L20994(lines 20994 20998) no Hoare annotation was computed. [2018-11-23 01:35:18,314 INFO L448 ceAbstractionStarter]: For program point L21027-1(line 21027) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L444 ceAbstractionStarter]: At program point L21027(line 21027) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |#funAddr~FloppyCreateClose.offset| main_~__cil_tmp16~28.offset) (= 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-11-23 01:35:18,320 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedInsertTailListENTRY(lines 21215 21226) the Hoare annotation is: true [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 21215 21226) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 21215 21226) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point L21656-1(lines 21648 21661) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L444 ceAbstractionStarter]: At program point L21656(line 21656) 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-11-23 01:35:18,320 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 21648 21661) the Hoare annotation is: (or (= 1 ~s~0) (or (not (= ~setEventCalled~0 1)) (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|)))) [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 21648 21661) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point RtlInitUnicodeStringFINAL(lines 22231 22238) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L451 ceAbstractionStarter]: At program point RtlInitUnicodeStringENTRY(lines 22231 22238) the Hoare annotation is: true [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point RtlInitUnicodeStringEXIT(lines 22231 22238) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L451 ceAbstractionStarter]: At program point PoStartNextPowerIrpENTRY(lines 22081 22087) the Hoare annotation is: true [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point PoStartNextPowerIrpFINAL(lines 22081 22087) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point PoStartNextPowerIrpEXIT(lines 22081 22087) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L451 ceAbstractionStarter]: At program point L22102(lines 22101 22115) the Hoare annotation is: true [2018-11-23 01:35:18,320 INFO L451 ceAbstractionStarter]: At program point L22105(lines 22104 22114) the Hoare annotation is: true [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point L22101(lines 22101 22115) no Hoare annotation was computed. [2018-11-23 01:35:18,320 INFO L448 ceAbstractionStarter]: For program point L22112(lines 22095 22117) no Hoare annotation was computed. [2018-11-23 01:35:18,321 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 22095 22117) no Hoare annotation was computed. [2018-11-23 01:35:18,321 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 22106 22113) no Hoare annotation was computed. [2018-11-23 01:35:18,321 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 22095 22117) the Hoare annotation is: true [2018-11-23 01:35:18,321 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 22106 22113) no Hoare annotation was computed. [2018-11-23 01:35:18,321 INFO L448 ceAbstractionStarter]: For program point L8351-1(line 8351) no Hoare annotation was computed. [2018-11-23 01:35:18,325 INFO L448 ceAbstractionStarter]: For program point L8541(lines 8541 8550) no Hoare annotation was computed. [2018-11-23 01:35:18,325 INFO L444 ceAbstractionStarter]: At program point L8351(line 8351) 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 ~customIrp~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 01:35:18,325 INFO L444 ceAbstractionStarter]: At program point L8475(lines 8353 8573) 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 (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)))) [2018-11-23 01:35:18,325 INFO L448 ceAbstractionStarter]: For program point L8541-2(lines 8541 8550) no Hoare annotation was computed. [2018-11-23 01:35:18,325 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 7951 8586) no Hoare annotation was computed. [2018-11-23 01:35:18,325 INFO L448 ceAbstractionStarter]: For program point L8459(lines 8459 8470) no Hoare annotation was computed. [2018-11-23 01:35:18,325 INFO L444 ceAbstractionStarter]: At program point L8203loopEntry(lines 8203 8206) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,325 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 7951 8586) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,325 INFO L448 ceAbstractionStarter]: For program point L8327-1(lines 8327 8328) no Hoare annotation was computed. [2018-11-23 01:35:18,325 INFO L444 ceAbstractionStarter]: At program point L8327(lines 8327 8328) 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 (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 .cse4 (= 1 ~s~0) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= 6 ~s~0) .cse4 .cse5 .cse6))) [2018-11-23 01:35:18,325 INFO L448 ceAbstractionStarter]: For program point L8261-1(lines 8256 8269) no Hoare annotation was computed. [2018-11-23 01:35:18,326 INFO L448 ceAbstractionStarter]: For program point L8261(lines 8261 8268) no Hoare annotation was computed. [2018-11-23 01:35:18,326 INFO L448 ceAbstractionStarter]: For program point L8319-1(line 8319) no Hoare annotation was computed. [2018-11-23 01:35:18,326 INFO L444 ceAbstractionStarter]: At program point L8319(line 8319) 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 ~customIrp~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-23 01:35:18,326 INFO L444 ceAbstractionStarter]: At program point L8567(line 8567) 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 (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)))) [2018-11-23 01:35:18,330 INFO L444 ceAbstractionStarter]: At program point L8567-1(line 8567) 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 (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)))) [2018-11-23 01:35:18,330 INFO L448 ceAbstractionStarter]: For program point L8369(lines 8369 8400) no Hoare annotation was computed. [2018-11-23 01:35:18,330 INFO L444 ceAbstractionStarter]: At program point L8559(line 8559) 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 (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)))) [2018-11-23 01:35:18,330 INFO L448 ceAbstractionStarter]: For program point L8559-1(line 8559) no Hoare annotation was computed. [2018-11-23 01:35:18,330 INFO L448 ceAbstractionStarter]: For program point L8353-1(lines 8353 8575) no Hoare annotation was computed. [2018-11-23 01:35:18,330 INFO L448 ceAbstractionStarter]: For program point L8353(lines 8353 8575) no Hoare annotation was computed. [2018-11-23 01:35:18,330 INFO L448 ceAbstractionStarter]: For program point L8411(lines 8411 8428) no Hoare annotation was computed. [2018-11-23 01:35:18,330 INFO L444 ceAbstractionStarter]: At program point L8221(lines 8216 8222) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,330 INFO L448 ceAbstractionStarter]: For program point L8436(lines 8436 8440) no Hoare annotation was computed. [2018-11-23 01:35:18,331 INFO L448 ceAbstractionStarter]: For program point L8436-1(lines 8436 8440) no Hoare annotation was computed. [2018-11-23 01:35:18,331 INFO L448 ceAbstractionStarter]: For program point L8411-2(lines 8411 8428) no Hoare annotation was computed. [2018-11-23 01:35:18,331 INFO L444 ceAbstractionStarter]: At program point L8461loopEntry(lines 8461 8464) 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 (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (<= FloppyStartDevice_~ntStatus~4 0))) [2018-11-23 01:35:18,331 INFO L444 ceAbstractionStarter]: At program point L8263(line 8263) 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-11-23 01:35:18,331 INFO L448 ceAbstractionStarter]: For program point L8321-2(lines 8321 8333) no Hoare annotation was computed. [2018-11-23 01:35:18,331 INFO L448 ceAbstractionStarter]: For program point L8321(lines 8321 8333) no Hoare annotation was computed. [2018-11-23 01:35:18,331 INFO L448 ceAbstractionStarter]: For program point L8379(lines 8379 8396) no Hoare annotation was computed. [2018-11-23 01:35:18,331 INFO L444 ceAbstractionStarter]: At program point L8214(lines 8185 8585) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,336 INFO L448 ceAbstractionStarter]: For program point L8371-1(line 8371) no Hoare annotation was computed. [2018-11-23 01:35:18,336 INFO L444 ceAbstractionStarter]: At program point L8371(line 8371) 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-11-23 01:35:18,336 INFO L444 ceAbstractionStarter]: At program point L8404(lines 8364 8477) 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-11-23 01:35:18,336 INFO L448 ceAbstractionStarter]: For program point L8256(lines 8256 8269) no Hoare annotation was computed. [2018-11-23 01:35:18,336 INFO L444 ceAbstractionStarter]: At program point L8207(lines 8185 8585) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,336 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 7951 8586) no Hoare annotation was computed. [2018-11-23 01:35:18,336 INFO L448 ceAbstractionStarter]: For program point L8364(lines 8364 8477) no Hoare annotation was computed. [2018-11-23 01:35:18,336 INFO L444 ceAbstractionStarter]: At program point L8546(line 8546) 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 (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= FloppyStartDevice_~ntStatus~4 259)))) [2018-11-23 01:35:18,336 INFO L448 ceAbstractionStarter]: For program point L8488(lines 8488 8524) no Hoare annotation was computed. [2018-11-23 01:35:18,336 INFO L444 ceAbstractionStarter]: At program point L8455(lines 8455 8457) 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-11-23 01:35:18,336 INFO L448 ceAbstractionStarter]: For program point L8455-1(lines 8455 8457) no Hoare annotation was computed. [2018-11-23 01:35:18,336 INFO L448 ceAbstractionStarter]: For program point L8488-2(lines 8488 8524) no Hoare annotation was computed. [2018-11-23 01:35:18,336 INFO L444 ceAbstractionStarter]: At program point L8538(lines 8538 8539) 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 (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)))) [2018-11-23 01:35:18,336 INFO L448 ceAbstractionStarter]: For program point L8546-1(line 8546) no Hoare annotation was computed. [2018-11-23 01:35:18,336 INFO L444 ceAbstractionStarter]: At program point L8249-1(line 8249) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,341 INFO L444 ceAbstractionStarter]: At program point L8249(line 8249) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,341 INFO L448 ceAbstractionStarter]: For program point L8538-1(lines 8538 8539) no Hoare annotation was computed. [2018-11-23 01:35:18,341 INFO L444 ceAbstractionStarter]: At program point L8258(line 8258) 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-11-23 01:35:18,341 INFO L448 ceAbstractionStarter]: For program point L8225-1(line 8225) no Hoare annotation was computed. [2018-11-23 01:35:18,341 INFO L444 ceAbstractionStarter]: At program point L8225(line 8225) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~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-11-23 01:35:18,341 INFO L448 ceAbstractionStarter]: For program point L8250(line 8250) no Hoare annotation was computed. [2018-11-23 01:35:18,342 INFO L444 ceAbstractionStarter]: At program point L8432-2(lines 8432 8474) 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 (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 (not (= FloppyStartDevice_~ntStatus~4 259)) .cse0) (and (= 0 FloppyStartDevice_~InterfaceType~0) .cse0))) [2018-11-23 01:35:18,342 INFO L448 ceAbstractionStarter]: For program point L8433(line 8433) no Hoare annotation was computed. [2018-11-23 01:35:18,342 INFO L448 ceAbstractionStarter]: For program point L8582-1(line 8582) no Hoare annotation was computed. [2018-11-23 01:35:18,342 INFO L444 ceAbstractionStarter]: At program point L8582(line 8582) 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 (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= FloppyStartDevice_~ntStatus~4 259)))) [2018-11-23 01:35:18,342 INFO L451 ceAbstractionStarter]: At program point ExFreePoolENTRY(lines 21190 21196) the Hoare annotation is: true [2018-11-23 01:35:18,342 INFO L448 ceAbstractionStarter]: For program point ExFreePoolFINAL(lines 21190 21196) no Hoare annotation was computed. [2018-11-23 01:35:18,342 INFO L448 ceAbstractionStarter]: For program point ExFreePoolEXIT(lines 21190 21196) no Hoare annotation was computed. [2018-11-23 01:35:18,342 INFO L451 ceAbstractionStarter]: At program point L21977(lines 21976 21990) the Hoare annotation is: true [2018-11-23 01:35:18,342 INFO L448 ceAbstractionStarter]: For program point L21976(lines 21976 21990) no Hoare annotation was computed. [2018-11-23 01:35:18,342 INFO L451 ceAbstractionStarter]: At program point L21980(lines 21979 21989) the Hoare annotation is: true [2018-11-23 01:35:18,342 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 21971 21992) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point L21987(lines 21971 21992) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 21971 21992) the Hoare annotation is: true [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21981 21988) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21981 21988) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L451 ceAbstractionStarter]: At program point L21375(lines 21374 21394) the Hoare annotation is: true [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point L21371(lines 21371 21395) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 21359 21397) the Hoare annotation is: (or (= 0 ~customIrp~0) (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 ~s~0))) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 01:35:18,349 INFO L451 ceAbstractionStarter]: At program point L21372(lines 21371 21395) the Hoare annotation is: true [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point L21380-1(line 21380) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 21359 21397) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L451 ceAbstractionStarter]: At program point L21380(line 21380) the Hoare annotation is: true [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point L21392(lines 21359 21397) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21376 21393) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21376 21393) no Hoare annotation was computed. [2018-11-23 01:35:18,349 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 21831 21838) the Hoare annotation is: true [2018-11-23 01:35:18,350 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 21831 21838) no Hoare annotation was computed. [2018-11-23 01:35:18,350 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 21831 21838) no Hoare annotation was computed. [2018-11-23 01:35:18,350 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 20919 20932) no Hoare annotation was computed. [2018-11-23 01:35:18,350 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 20919 20932) 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-11-23 01:35:18,350 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 20919 20932) no Hoare annotation was computed. [2018-11-23 01:35:18,350 INFO L448 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2800 3015) no Hoare annotation was computed. [2018-11-23 01:35:18,350 INFO L451 ceAbstractionStarter]: At program point DriverEntryENTRY(lines 2800 3015) the Hoare annotation is: true [2018-11-23 01:35:18,350 INFO L448 ceAbstractionStarter]: For program point L2957(lines 2957 2961) no Hoare annotation was computed. [2018-11-23 01:35:18,350 INFO L444 ceAbstractionStarter]: At program point L2891(lines 2886 2892) 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-11-23 01:35:18,357 INFO L444 ceAbstractionStarter]: At program point L2887loopEntry(lines 2887 2890) 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-11-23 01:35:18,357 INFO L444 ceAbstractionStarter]: At program point L2976(line 2976) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0)) (= 0 DriverEntry_~ntStatus~0)) [2018-11-23 01:35:18,357 INFO L444 ceAbstractionStarter]: At program point L2974(line 2974) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0)) (= 0 DriverEntry_~ntStatus~0)) [2018-11-23 01:35:18,357 INFO L448 ceAbstractionStarter]: For program point L2976-1(line 2976) no Hoare annotation was computed. [2018-11-23 01:35:18,357 INFO L448 ceAbstractionStarter]: For program point L2974-1(line 2974) no Hoare annotation was computed. [2018-11-23 01:35:18,357 INFO L448 ceAbstractionStarter]: For program point L3003(lines 3003 3011) no Hoare annotation was computed. [2018-11-23 01:35:18,357 INFO L448 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2800 3015) no Hoare annotation was computed. [2018-11-23 01:35:18,357 INFO L448 ceAbstractionStarter]: For program point L3003-2(lines 3003 3011) no Hoare annotation was computed. [2018-11-23 01:35:18,357 INFO L448 ceAbstractionStarter]: For program point L2985(lines 2985 2994) no Hoare annotation was computed. [2018-11-23 01:35:18,357 INFO L444 ceAbstractionStarter]: At program point L2950(line 2950) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0)) (= 0 DriverEntry_~ntStatus~0)) [2018-11-23 01:35:18,358 INFO L448 ceAbstractionStarter]: For program point L2985-2(lines 2985 2994) no Hoare annotation was computed. [2018-11-23 01:35:18,358 INFO L448 ceAbstractionStarter]: For program point L2950-1(line 2950) no Hoare annotation was computed. [2018-11-23 01:35:18,358 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,358 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,358 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,358 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,358 INFO L448 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceEXIT(lines 21641 21647) no Hoare annotation was computed. [2018-11-23 01:35:18,358 INFO L451 ceAbstractionStarter]: At program point IoSetHardErrorOrVerifyDeviceENTRY(lines 21641 21647) the Hoare annotation is: true [2018-11-23 01:35:18,358 INFO L448 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceFINAL(lines 21641 21647) no Hoare annotation was computed. [2018-11-23 01:35:18,358 INFO L448 ceAbstractionStarter]: For program point L19682(lines 19682 19695) no Hoare annotation was computed. [2018-11-23 01:35:18,358 INFO L451 ceAbstractionStarter]: At program point L19525-2(lines 19525 19564) the Hoare annotation is: true [2018-11-23 01:35:18,358 INFO L448 ceAbstractionStarter]: For program point L19661(lines 19661 19701) no Hoare annotation was computed. [2018-11-23 01:35:18,362 INFO L448 ceAbstractionStarter]: For program point L19608(lines 19608 19714) no Hoare annotation was computed. [2018-11-23 01:35:18,362 INFO L448 ceAbstractionStarter]: For program point L19526(line 19526) no Hoare annotation was computed. [2018-11-23 01:35:18,362 INFO L448 ceAbstractionStarter]: For program point L19621(lines 19621 19712) no Hoare annotation was computed. [2018-11-23 01:35:18,362 INFO L448 ceAbstractionStarter]: For program point L19576(lines 19576 19718) no Hoare annotation was computed. [2018-11-23 01:35:18,362 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 19403 19721) no Hoare annotation was computed. [2018-11-23 01:35:18,362 INFO L448 ceAbstractionStarter]: For program point L19634(lines 19634 19710) no Hoare annotation was computed. [2018-11-23 01:35:18,362 INFO L448 ceAbstractionStarter]: For program point L19646(lines 19646 19708) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19551(lines 19551 19555) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19675(lines 19675 19697) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19593(lines 19593 19716) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 19403 19721) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19668(lines 19668 19699) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19656(lines 19656 19705) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19689(lines 19689 19693) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19656-2(lines 19656 19705) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19536(lines 19536 19559) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 19403 19721) the Hoare annotation is: true [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19536-1(lines 19536 19559) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L451 ceAbstractionStarter]: At program point L19565(lines 19524 19566) the Hoare annotation is: true [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point IoDetachDeviceEXIT(lines 21489 21495) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point IoDetachDeviceFINAL(lines 21489 21495) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L451 ceAbstractionStarter]: At program point IoDetachDeviceENTRY(lines 21489 21495) the Hoare annotation is: true [2018-11-23 01:35:18,363 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 19926 20023) the Hoare annotation is: (or (and (= 0 ~customIrp~0) (= 1 ~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-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19970-1(lines 19970 19971) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L448 ceAbstractionStarter]: For program point L19977(lines 19977 19988) no Hoare annotation was computed. [2018-11-23 01:35:18,363 INFO L444 ceAbstractionStarter]: At program point L19983(lines 19978 19984) 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))) (= ~s~0 |old(~s~0)|)) [2018-11-23 01:35:18,368 INFO L444 ceAbstractionStarter]: At program point L19979loopEntry(lines 19979 19982) 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))) (= ~s~0 |old(~s~0)|)) [2018-11-23 01:35:18,369 INFO L444 ceAbstractionStarter]: At program point L19959loopEntry(lines 19959 19962) the Hoare annotation is: (or (and (= 0 ~customIrp~0) (= 1 ~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-11-23 01:35:18,369 INFO L448 ceAbstractionStarter]: For program point L19967-1(line 19967) no Hoare annotation was computed. [2018-11-23 01:35:18,369 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 19926 20023) no Hoare annotation was computed. [2018-11-23 01:35:18,369 INFO L444 ceAbstractionStarter]: At program point L19967(line 19967) the Hoare annotation is: (or (and (= 0 ~customIrp~0) (= 1 ~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-11-23 01:35:18,369 INFO L444 ceAbstractionStarter]: At program point L19963(lines 19958 19964) the Hoare annotation is: (or (and (= 0 ~customIrp~0) (= 1 ~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-11-23 01:35:18,369 INFO L448 ceAbstractionStarter]: For program point L20007(lines 20007 20020) no Hoare annotation was computed. [2018-11-23 01:35:18,369 INFO L448 ceAbstractionStarter]: For program point L20005-1(line 20005) no Hoare annotation was computed. [2018-11-23 01:35:18,369 INFO L444 ceAbstractionStarter]: At program point L20005(line 20005) 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))) (= ~s~0 |old(~s~0)|)) [2018-11-23 01:35:18,369 INFO L448 ceAbstractionStarter]: For program point L20007-2(lines 20007 20020) no Hoare annotation was computed. [2018-11-23 01:35:18,369 INFO L444 ceAbstractionStarter]: At program point L19970(lines 19970 19971) the Hoare annotation is: (or (and (= 0 ~customIrp~0) (= 1 ~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-11-23 01:35:18,369 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 19926 20023) no Hoare annotation was computed. [2018-11-23 01:35:18,369 INFO L448 ceAbstractionStarter]: For program point L20013-1(line 20013) no Hoare annotation was computed. [2018-11-23 01:35:18,369 INFO L444 ceAbstractionStarter]: At program point L20013(line 20013) the Hoare annotation is: (let ((.cse0 (= 259 FlFdcDeviceIo_~ntStatus~16)) (.cse1 (= 1 ~setEventCalled~0))) (or (and .cse0 (= 6 ~s~0) .cse1) (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 (= 1 ~s~0) .cse1))) [2018-11-23 01:35:18,369 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 21547 21580) no Hoare annotation was computed. [2018-11-23 01:35:18,369 INFO L451 ceAbstractionStarter]: At program point L21568(lines 21567 21577) the Hoare annotation is: true [2018-11-23 01:35:18,369 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 21547 21580) the Hoare annotation is: true [2018-11-23 01:35:18,369 INFO L451 ceAbstractionStarter]: At program point L21565(lines 21564 21578) the Hoare annotation is: true [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point L21564(lines 21564 21578) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point L21575(lines 21547 21580) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21569 21576) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21569 21576) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point L21471(lines 21471 21485) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L451 ceAbstractionStarter]: At program point L21472(lines 21471 21485) the Hoare annotation is: true [2018-11-23 01:35:18,372 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 21467 21487) the Hoare annotation is: true [2018-11-23 01:35:18,372 INFO L451 ceAbstractionStarter]: At program point L21475(lines 21474 21484) the Hoare annotation is: true [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 21467 21487) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21476 21483) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point L21482(lines 21467 21487) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21476 21483) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4521 4526) the Hoare annotation is: true [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point L4523(line 4523) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point L4522(lines 4522 4524) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4521 4526) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point L4522-2(lines 4521 4526) no Hoare annotation was computed. [2018-11-23 01:35:18,372 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4523) no Hoare annotation was computed. [2018-11-23 01:35:18,373 INFO L448 ceAbstractionStarter]: For program point MmResetDriverPagingFINAL(lines 21950 21956) no Hoare annotation was computed. [2018-11-23 01:35:18,373 INFO L448 ceAbstractionStarter]: For program point MmResetDriverPagingEXIT(lines 21950 21956) no Hoare annotation was computed. [2018-11-23 01:35:18,373 INFO L451 ceAbstractionStarter]: At program point MmResetDriverPagingENTRY(lines 21950 21956) the Hoare annotation is: true [2018-11-23 01:35:18,373 INFO L451 ceAbstractionStarter]: At program point L21593(lines 21592 21606) the Hoare annotation is: true [2018-11-23 01:35:18,373 INFO L448 ceAbstractionStarter]: For program point L21592(lines 21592 21606) no Hoare annotation was computed. [2018-11-23 01:35:18,373 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 21585 21608) no Hoare annotation was computed. [2018-11-23 01:35:18,373 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 21585 21608) the Hoare annotation is: true [2018-11-23 01:35:18,373 INFO L451 ceAbstractionStarter]: At program point L21596(lines 21595 21605) the Hoare annotation is: true [2018-11-23 01:35:18,373 INFO L448 ceAbstractionStarter]: For program point L21603(lines 21585 21608) no Hoare annotation was computed. [2018-11-23 01:35:18,376 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21597 21604) no Hoare annotation was computed. [2018-11-23 01:35:18,376 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21597 21604) no Hoare annotation was computed. [2018-11-23 01:35:18,376 INFO L448 ceAbstractionStarter]: For program point L21623(lines 21623 21637) no Hoare annotation was computed. [2018-11-23 01:35:18,376 INFO L451 ceAbstractionStarter]: At program point L21624(lines 21623 21637) the Hoare annotation is: true [2018-11-23 01:35:18,376 INFO L451 ceAbstractionStarter]: At program point L21627(lines 21626 21636) the Hoare annotation is: true [2018-11-23 01:35:18,376 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 21619 21639) no Hoare annotation was computed. [2018-11-23 01:35:18,376 INFO L448 ceAbstractionStarter]: For program point L21634(lines 21619 21639) no Hoare annotation was computed. [2018-11-23 01:35:18,376 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 21619 21639) the Hoare annotation is: true [2018-11-23 01:35:18,376 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21628 21635) no Hoare annotation was computed. [2018-11-23 01:35:18,376 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21628 21635) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9185(lines 9185 9220) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9152(line 9152) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9119(lines 9119 9159) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9152-1(line 9152) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9235(lines 9230 9236) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9252loopEntry(lines 9252 9255) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9128(lines 9119 9159) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9087(line 9087) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9087-1(line 9087) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9112(line 9112) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9112-1(line 9112) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9096(line 9096) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9096-1(line 9096) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9278(lines 9273 9279) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9229(lines 9229 9262) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9229-1(lines 9063 9287) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteEXIT(lines 8976 9288) no Hoare annotation was computed. [2018-11-23 01:35:18,377 INFO L451 ceAbstractionStarter]: At program point L9213(lines 9208 9214) the Hoare annotation is: true [2018-11-23 01:35:18,377 INFO L448 ceAbstractionStarter]: For program point L9238(line 9238) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9065loopEntry(lines 9065 9068) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteFINAL(lines 8976 9288) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9206(lines 9199 9216) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9231loopEntry(lines 9231 9234) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point FloppyReadWriteENTRY(lines 8976 9288) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9256(lines 9251 9257) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9223(lines 9168 9265) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9100(line 9100) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9100-1(line 9100) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9199(lines 9199 9218) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9274loopEntry(lines 9274 9277) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9134-2(lines 9134 9138) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9200(lines 9185 9220) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9134(lines 9134 9138) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9267(lines 9267 9285) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point L9069(lines 9064 9070) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9259(line 9259) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9168(lines 9168 9265) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9127(lines 9127 9157) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point L9094(lines 9094 9105) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point ObfDereferenceObjectFINAL(lines 21994 22000) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L451 ceAbstractionStarter]: At program point ObfDereferenceObjectENTRY(lines 21994 22000) the Hoare annotation is: true [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point ObfDereferenceObjectEXIT(lines 21994 22000) no Hoare annotation was computed. [2018-11-23 01:35:18,381 INFO L448 ceAbstractionStarter]: For program point KeInitializeEventEXIT(lines 21795 21801) no Hoare annotation was computed. [2018-11-23 01:35:18,382 INFO L451 ceAbstractionStarter]: At program point KeInitializeEventENTRY(lines 21795 21801) the Hoare annotation is: true [2018-11-23 01:35:18,382 INFO L448 ceAbstractionStarter]: For program point KeInitializeEventFINAL(lines 21795 21801) no Hoare annotation was computed. [2018-11-23 01:35:18,382 INFO L444 ceAbstractionStarter]: At program point L4929(lines 4924 4930) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 01:35:18,382 INFO L444 ceAbstractionStarter]: At program point L4925loopEntry(lines 4925 4928) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 4914 4946) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L444 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 4914 4946) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 01:35:18,386 INFO L444 ceAbstractionStarter]: At program point L4942(line 4942) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point L4942-1(line 4942) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 4914 4946) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L451 ceAbstractionStarter]: At program point L22039(lines 22038 22053) the Hoare annotation is: true [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point L22035(lines 22035 22054) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 22003 22079) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L451 ceAbstractionStarter]: At program point L22023(line 22023) the Hoare annotation is: true [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point L22060(lines 22060 22075) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 22003 22079) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point L22069-2(lines 22056 22076) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L448 ceAbstractionStarter]: For program point L22069(lines 22069 22074) no Hoare annotation was computed. [2018-11-23 01:35:18,386 INFO L451 ceAbstractionStarter]: At program point L22036(lines 22035 22054) the Hoare annotation is: true [2018-11-23 01:35:18,386 INFO L451 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 22003 22079) the Hoare annotation is: true [2018-11-23 01:35:18,387 INFO L448 ceAbstractionStarter]: For program point L22061(lines 22061 22067) no Hoare annotation was computed. [2018-11-23 01:35:18,387 INFO L448 ceAbstractionStarter]: For program point L22016-1(line 22016) no Hoare annotation was computed. [2018-11-23 01:35:18,387 INFO L451 ceAbstractionStarter]: At program point L22016(line 22016) the Hoare annotation is: true [2018-11-23 01:35:18,387 INFO L448 ceAbstractionStarter]: For program point L22021(lines 22021 22027) no Hoare annotation was computed. [2018-11-23 01:35:18,387 INFO L451 ceAbstractionStarter]: At program point L22033(lines 22032 22055) the Hoare annotation is: true [2018-11-23 01:35:18,387 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 22040 22052) no Hoare annotation was computed. [2018-11-23 01:35:18,387 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 22040 22052) no Hoare annotation was computed. [2018-11-23 01:35:18,387 INFO L448 ceAbstractionStarter]: For program point L22013(lines 22013 22031) no Hoare annotation was computed. [2018-11-23 01:35:18,387 INFO L448 ceAbstractionStarter]: For program point L22013-1(lines 22012 22078) no Hoare annotation was computed. [2018-11-23 01:35:18,387 INFO L451 ceAbstractionStarter]: At program point L22051(lines 22012 22078) the Hoare annotation is: true [2018-11-23 01:35:18,387 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 21229 21239) no Hoare annotation was computed. [2018-11-23 01:35:18,393 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedRemoveHeadListENTRY(lines 21229 21239) the Hoare annotation is: true [2018-11-23 01:35:18,393 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 21229 21239) no Hoare annotation was computed. [2018-11-23 01:35:18,393 INFO L451 ceAbstractionStarter]: At program point L8863(lines 8858 8864) the Hoare annotation is: true [2018-11-23 01:35:18,393 INFO L448 ceAbstractionStarter]: For program point FloppyPowerEXIT(lines 8598 8975) no Hoare annotation was computed. [2018-11-23 01:35:18,393 INFO L451 ceAbstractionStarter]: At program point L8748(lines 8747 8930) the Hoare annotation is: true [2018-11-23 01:35:18,393 INFO L451 ceAbstractionStarter]: At program point L8971(line 8971) the Hoare annotation is: true [2018-11-23 01:35:18,393 INFO L448 ceAbstractionStarter]: For program point L8971-1(line 8971) no Hoare annotation was computed. [2018-11-23 01:35:18,393 INFO L448 ceAbstractionStarter]: For program point L8806(line 8806) no Hoare annotation was computed. [2018-11-23 01:35:18,393 INFO L448 ceAbstractionStarter]: For program point L8889(lines 8889 8904) no Hoare annotation was computed. [2018-11-23 01:35:18,393 INFO L451 ceAbstractionStarter]: At program point L8716(lines 8711 8717) the Hoare annotation is: true [2018-11-23 01:35:18,393 INFO L451 ceAbstractionStarter]: At program point L8939(line 8939) the Hoare annotation is: true [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8939-1(lines 8935 8941) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L451 ceAbstractionStarter]: At program point L8840(line 8840) the Hoare annotation is: true [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8840-1(line 8840) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8766-2(lines 8766 8778) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8766(lines 8766 8778) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8791(lines 8791 8822) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8750(lines 8750 8929) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 8755 8927) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L451 ceAbstractionStarter]: At program point L8899(lines 8899 8900) the Hoare annotation is: true [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8899-1(lines 8899 8900) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 8755 8927) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point FloppyPowerFINAL(lines 8598 8975) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L451 ceAbstractionStarter]: At program point L8850(lines 8845 8851) the Hoare annotation is: true [2018-11-23 01:35:18,394 INFO L451 ceAbstractionStarter]: At program point L8817(line 8817) the Hoare annotation is: true [2018-11-23 01:35:18,394 INFO L451 ceAbstractionStarter]: At program point L8784(line 8784) the Hoare annotation is: true [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8817-1(line 8817) no Hoare annotation was computed. [2018-11-23 01:35:18,394 INFO L451 ceAbstractionStarter]: At program point L8751(lines 8750 8929) the Hoare annotation is: true [2018-11-23 01:35:18,394 INFO L448 ceAbstractionStarter]: For program point L8784-1(line 8784) no Hoare annotation was computed. [2018-11-23 01:35:18,400 INFO L448 ceAbstractionStarter]: For program point L8933(lines 8708 8974) no Hoare annotation was computed. [2018-11-23 01:35:18,400 INFO L451 ceAbstractionStarter]: At program point L8859loopEntry(lines 8859 8862) the Hoare annotation is: true [2018-11-23 01:35:18,400 INFO L451 ceAbstractionStarter]: At program point L8876(line 8876) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8876-1(line 8876) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8835(lines 8835 8912) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8835-1(lines 8755 8925) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8769(lines 8769 8774) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8926(lines 8753 8928) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point FloppyPowerENTRY(lines 8598 8975) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8844(lines 8844 8870) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8844-2(lines 8844 8870) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8803(lines 8798 8804) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8712loopEntry(lines 8712 8715) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8828(line 8828) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8828-1(line 8828) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8762(lines 8757 8763) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8919(lines 8914 8920) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8886(lines 8886 8908) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8796(line 8796) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8796-1(lines 8796 8802) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8747(lines 8747 8930) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8846loopEntry(lines 8846 8849) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point RtlFreeUnicodeStringFINAL(lines 22213 22219) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point RtlFreeUnicodeStringEXIT(lines 22213 22219) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point RtlFreeUnicodeStringENTRY(lines 22213 22219) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point L8593(line 8593) the Hoare annotation is: true [2018-11-23 01:35:18,401 INFO L448 ceAbstractionStarter]: For program point L8593-1(line 8593) no Hoare annotation was computed. [2018-11-23 01:35:18,401 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 8587 8597) the Hoare annotation is: true [2018-11-23 01:35:18,402 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 8587 8597) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 8587 8597) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point L21849(lines 21849 21854) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L444 ceAbstractionStarter]: At program point L21874(lines 21873 21883) the Hoare annotation is: (let ((.cse1 (= 1 ~s~0)) (.cse3 (= 0 ~customIrp~0)) (.cse7 (= ~compRegistered~0 0))) (let ((.cse0 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse6 (not (= 0 ~pended~0))) (.cse9 (not .cse7)) (.cse10 (and .cse1 .cse3)) (.cse11 (not (= |old(~customIrp~0)| 0))) (.cse8 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (= 1 ~setEventCalled~0))) (or (and (not (= ~customIrp~0 1)) .cse0 .cse1 .cse2) (and .cse3 (= 1 |old(~customIrp~0)|) .cse1 .cse2) (or .cse4 .cse5 .cse6 .cse7 .cse8))) (or (and .cse0 .cse1) (or .cse4 .cse5 (not (= 6 |old(~s~0)|)) .cse6 .cse7)) (or (or .cse9 .cse6 .cse8) .cse10 .cse11) (or .cse9 .cse10 .cse11 .cse8 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 21843 21886) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 21875 21882) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 21875 21882) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point L21881(lines 21843 21886) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point L21848(lines 21848 21869) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L444 ceAbstractionStarter]: At program point L21856(lines 21848 21869) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0))) (let ((.cse4 (not .cse3)) (.cse5 (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) (.cse6 (not (= |old(~customIrp~0)| 0))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse7 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (= 6 |old(~s~0)|)) .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (or .cse4 .cse2 .cse7) .cse5 .cse6) (or (and (= ~customIrp~0 |old(~customIrp~0)|) (= 1 ~s~0) (= 1 ~setEventCalled~0)) (or .cse0 .cse1 .cse2 .cse3 .cse7))))) [2018-11-23 01:35:18,407 INFO L444 ceAbstractionStarter]: At program point L21863(line 21863) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse4 (not .cse3)) (.cse6 (not (= |old(~customIrp~0)| 0))) (.cse5 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (= 6 |old(~s~0)|)) .cse2 .cse3) (or (or .cse4 .cse2 .cse5) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5) (or .cse4 .cse6 .cse5 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point L21861(lines 21861 21867) no Hoare annotation was computed. [2018-11-23 01:35:18,407 INFO L448 ceAbstractionStarter]: For program point L21861-1(lines 21847 21885) no Hoare annotation was computed. [2018-11-23 01:35:18,408 INFO L444 ceAbstractionStarter]: At program point L21871(lines 21870 21884) the Hoare annotation is: (let ((.cse1 (= 1 ~s~0)) (.cse3 (= 0 ~customIrp~0)) (.cse7 (= ~compRegistered~0 0))) (let ((.cse0 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse6 (not (= 0 ~pended~0))) (.cse9 (not .cse7)) (.cse10 (and .cse1 .cse3)) (.cse11 (not (= |old(~customIrp~0)| 0))) (.cse8 (not (= 1 |old(~s~0)|)))) (and (let ((.cse2 (= 1 ~setEventCalled~0))) (or (and (not (= ~customIrp~0 1)) .cse0 .cse1 .cse2) (and .cse3 (= 1 |old(~customIrp~0)|) .cse1 .cse2) (or .cse4 .cse5 .cse6 .cse7 .cse8))) (or (and .cse0 .cse1) (or .cse4 .cse5 (not (= 6 |old(~s~0)|)) .cse6 .cse7)) (or (or .cse9 .cse6 .cse8) .cse10 .cse11) (or .cse9 .cse10 .cse11 .cse8 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,420 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 21843 21886) the Hoare annotation is: (let ((.cse9 (= ~compRegistered~0 0)) (.cse10 (= ~s~0 |old(~s~0)|))) (let ((.cse5 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse6 (= 1 ~setEventCalled~0)) (.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse3 (and .cse10 (= 0 ~customIrp~0))) (.cse0 (not .cse9)) (.cse4 (not (= |old(~customIrp~0)| 0))) (.cse2 (not (= 1 |old(~s~0)|)))) (and (or (or .cse0 .cse1 .cse2) .cse3 .cse4) (or (and .cse5 (= 1 ~s~0) .cse6) (or .cse7 .cse8 .cse1 .cse9 .cse2)) (or (and .cse5 .cse10 .cse6) (or .cse7 .cse8 (not (= 6 |old(~s~0)|)) .cse1 .cse9)) (or .cse3 .cse0 .cse4 .cse2 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,420 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 21821 21828) no Hoare annotation was computed. [2018-11-23 01:35:18,420 INFO L451 ceAbstractionStarter]: At program point KeReleaseSemaphoreENTRY(lines 21821 21828) the Hoare annotation is: true [2018-11-23 01:35:18,420 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 21821 21828) no Hoare annotation was computed. [2018-11-23 01:35:18,420 INFO L451 ceAbstractionStarter]: At program point FloppyUnloadENTRY(lines 3016 3033) the Hoare annotation is: true [2018-11-23 01:35:18,420 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadEXIT(lines 3016 3033) no Hoare annotation was computed. [2018-11-23 01:35:18,420 INFO L451 ceAbstractionStarter]: At program point L3029(line 3029) the Hoare annotation is: true [2018-11-23 01:35:18,420 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadFINAL(lines 3016 3033) no Hoare annotation was computed. [2018-11-23 01:35:18,420 INFO L451 ceAbstractionStarter]: At program point L3025(lines 3020 3026) the Hoare annotation is: true [2018-11-23 01:35:18,420 INFO L451 ceAbstractionStarter]: At program point L3021loopEntry(lines 3021 3024) the Hoare annotation is: true [2018-11-23 01:35:18,420 INFO L448 ceAbstractionStarter]: For program point L21750(lines 21750 21756) no Hoare annotation was computed. [2018-11-23 01:35:18,420 INFO L448 ceAbstractionStarter]: For program point L21754-1(lines 21746 21759) no Hoare annotation was computed. [2018-11-23 01:35:18,420 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 21746 21759) the Hoare annotation is: (let ((.cse1 (not (= ~compRegistered~0 0))) (.cse3 (not (= 0 ~pended~0))) (.cse2 (not (= 1 |old(~s~0)|))) (.cse0 (= 1 ~s~0))) (and (or .cse0 .cse1 .cse2 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (or (not (= ~PagingReferenceCount~0 1)) .cse3 .cse2) (= ~s~0 |old(~s~0)|)) (or (or .cse1 .cse3 .cse2) .cse0))) [2018-11-23 01:35:18,420 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 21746 21759) no Hoare annotation was computed. [2018-11-23 01:35:18,420 INFO L444 ceAbstractionStarter]: At program point L21754(line 21754) 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 .cse0 .cse1) (or .cse2 .cse1 (= (mod ~PagingReferenceCount~0 4294967296) 0)))) [2018-11-23 01:35:18,427 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,427 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,427 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,427 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,427 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-11-23 01:35:18,427 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,428 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-11-23 01:35:18,428 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-11-23 01:35:18,428 INFO L451 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 2106 2110) the Hoare annotation is: true [2018-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 2106 2110) no Hoare annotation was computed. [2018-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 2106 2110) no Hoare annotation was computed. [2018-11-23 01:35:18,428 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-11-23 01:35:18,428 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,428 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-11-23 01:35:18,428 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-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point MmPageEntireDriverEXIT(lines 21942 21948) no Hoare annotation was computed. [2018-11-23 01:35:18,428 INFO L451 ceAbstractionStarter]: At program point MmPageEntireDriverENTRY(lines 21942 21948) the Hoare annotation is: true [2018-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point MmPageEntireDriverFINAL(lines 21942 21948) no Hoare annotation was computed. [2018-11-23 01:35:18,428 INFO L451 ceAbstractionStarter]: At program point L22199(lines 22198 22208) the Hoare annotation is: true [2018-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point L22195(lines 22195 22209) no Hoare annotation was computed. [2018-11-23 01:35:18,428 INFO L451 ceAbstractionStarter]: At program point L22196(lines 22195 22209) the Hoare annotation is: true [2018-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point L22206(lines 22190 22211) no Hoare annotation was computed. [2018-11-23 01:35:18,428 INFO L448 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 22190 22211) no Hoare annotation was computed. [2018-11-23 01:35:18,435 INFO L451 ceAbstractionStarter]: At program point RtlDeleteRegistryValueENTRY(lines 22190 22211) the Hoare annotation is: true [2018-11-23 01:35:18,435 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 22200 22207) no Hoare annotation was computed. [2018-11-23 01:35:18,435 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 22200 22207) no Hoare annotation was computed. [2018-11-23 01:35:18,435 INFO L448 ceAbstractionStarter]: For program point mallocFINAL(lines 21148 21154) no Hoare annotation was computed. [2018-11-23 01:35:18,435 INFO L448 ceAbstractionStarter]: For program point mallocEXIT(lines 21148 21154) no Hoare annotation was computed. [2018-11-23 01:35:18,435 INFO L451 ceAbstractionStarter]: At program point mallocENTRY(lines 21148 21154) the Hoare annotation is: true [2018-11-23 01:35:18,435 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,435 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,435 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,435 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point IoDeleteDeviceEXIT(lines 21459 21465) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point IoDeleteDeviceFINAL(lines 21459 21465) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L451 ceAbstractionStarter]: At program point IoDeleteDeviceENTRY(lines 21459 21465) the Hoare annotation is: true [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,436 INFO L451 ceAbstractionStarter]: At program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point ExAcquireFastMutexEXIT(lines 21156 21162) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L451 ceAbstractionStarter]: At program point ExAcquireFastMutexENTRY(lines 21156 21162) the Hoare annotation is: true [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point ExAcquireFastMutexFINAL(lines 21156 21162) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point L22261(lines 22244 22266) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 22244 22266) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L451 ceAbstractionStarter]: At program point RtlQueryRegistryValuesENTRY(lines 22244 22266) the Hoare annotation is: true [2018-11-23 01:35:18,436 INFO L451 ceAbstractionStarter]: At program point L22254(lines 22253 22263) the Hoare annotation is: true [2018-11-23 01:35:18,436 INFO L451 ceAbstractionStarter]: At program point L22251(lines 22250 22264) the Hoare annotation is: true [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 22255 22262) no Hoare annotation was computed. [2018-11-23 01:35:18,436 INFO L448 ceAbstractionStarter]: For program point L22250(lines 22250 22264) no Hoare annotation was computed. [2018-11-23 01:35:18,444 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 22255 22262) no Hoare annotation was computed. [2018-11-23 01:35:18,445 INFO L444 ceAbstractionStarter]: At program point L21701(lines 21700 21715) the Hoare annotation is: (let ((.cse2 (= ~compRegistered~0 0))) (let ((.cse0 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (not .cse2)) (.cse5 (not (= 3 |old(~s~0)|))) (.cse6 (not (= ~customIrp~0 0)))) (and (or (and (= 0 (+ IofCallDriver_~__cil_tmp9~27 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5)) (or .cse0 (or .cse1 .cse2 (not (= 1 |old(~s~0)|))))) (or .cse3 (or .cse4 .cse1 .cse5) .cse6) (or .cse0 .cse4 .cse1 (= 3 ~s~0) .cse5) (or .cse3 .cse4 .cse5 .cse6 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,445 INFO L444 ceAbstractionStarter]: At program point L21713(lines 21674 21742) the Hoare annotation is: (let ((.cse9 (= ~compRegistered~0 0))) (let ((.cse0 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse1 (not .cse9)) (.cse3 (not (= 3 |old(~s~0)|))) (.cse5 (not (= ~customIrp~0 0)))) (and (or .cse0 (= 3 ~s~0) .cse1 .cse2 .cse3) (or .cse4 (or .cse1 .cse2 .cse3) .cse5) (let ((.cse6 (= 0 (+ IofCallDriver_~__cil_tmp9~27 1073741802))) (.cse7 (= 1 ~setEventCalled~0)) (.cse8 (= ~s~0 5))) (or (and .cse6 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse7 .cse8) (and .cse6 .cse7 (= IofCallDriver_~returnVal2~0 259) .cse8) (or .cse0 (or .cse2 .cse9 (not (= 1 |old(~s~0)|)))) (and .cse6 (= 0 IofCallDriver_~returnVal2~0) .cse7 .cse8))) (or .cse4 .cse1 .cse3 .cse5 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,445 INFO L444 ceAbstractionStarter]: At program point L21685(line 21685) the Hoare annotation is: (let ((.cse5 (= ~compRegistered~0 0))) (let ((.cse4 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse0 (not .cse5)) (.cse2 (not (= 3 |old(~s~0)|))) (.cse3 (not (= ~customIrp~0 0)))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or .cse4 .cse0 .cse1 .cse2) (or (or .cse4 (or .cse1 .cse5 (not (= 1 |old(~s~0)|)))) (and (= 0 (+ IofCallDriver_~__cil_tmp9~27 1073741802)) (= 1 ~s~0) (= 1 ~setEventCalled~0))) (or .cse0 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,445 INFO L448 ceAbstractionStarter]: For program point L21697(lines 21697 21716) no Hoare annotation was computed. [2018-11-23 01:35:18,445 INFO L448 ceAbstractionStarter]: For program point L21722(lines 21722 21739) no Hoare annotation was computed. [2018-11-23 01:35:18,445 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 21664 21743) the Hoare annotation is: (let ((.cse2 (= ~compRegistered~0 0))) (let ((.cse0 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (not .cse2)) (.cse5 (not (= 3 |old(~s~0)|))) (.cse6 (not (= ~customIrp~0 0)))) (and (or (or .cse0 (or .cse1 .cse2 (not (= 1 |old(~s~0)|)))) .cse3) (or .cse3 (or .cse4 .cse1 .cse5) .cse6) (or .cse0 .cse4 .cse1 (= 3 ~s~0) .cse5) (or .cse3 .cse4 .cse5 .cse6 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,445 INFO L448 ceAbstractionStarter]: For program point L21731(lines 21731 21738) no Hoare annotation was computed. [2018-11-23 01:35:18,445 INFO L444 ceAbstractionStarter]: At program point L21698(lines 21697 21716) the Hoare annotation is: (let ((.cse2 (= ~compRegistered~0 0))) (let ((.cse0 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (not .cse2)) (.cse5 (not (= 3 |old(~s~0)|))) (.cse6 (not (= ~customIrp~0 0)))) (and (or (and (= 0 (+ IofCallDriver_~__cil_tmp9~27 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5)) (or .cse0 (or .cse1 .cse2 (not (= 1 |old(~s~0)|))))) (or .cse3 (or .cse4 .cse1 .cse5) .cse6) (or .cse0 .cse4 .cse1 (= 3 ~s~0) .cse5) (or .cse3 .cse4 .cse5 .cse6 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 21664 21743) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 21664 21743) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point L21723(lines 21723 21729) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point L21736-1(lines 21718 21740) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L444 ceAbstractionStarter]: At program point L21736(line 21736) the Hoare annotation is: (let ((.cse5 (= ~compRegistered~0 0))) (let ((.cse0 (not .cse5)) (.cse2 (not (= 3 |old(~s~0)|))) (.cse3 (not (= ~customIrp~0 0))) (.cse4 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0)))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or .cse4 .cse0 .cse1 .cse2) (or .cse0 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or .cse4 (or .cse1 .cse5 (not (= 1 |old(~s~0)|))))))) [2018-11-23 01:35:18,455 INFO L444 ceAbstractionStarter]: At program point L21678(line 21678) the Hoare annotation is: (let ((.cse5 (= ~compRegistered~0 0))) (let ((.cse4 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse0 (not .cse5)) (.cse2 (not (= 3 |old(~s~0)|))) (.cse3 (not (= ~customIrp~0 0)))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or (or .cse4 (or .cse1 .cse5 (not (= 1 |old(~s~0)|)))) (= ~s~0 |old(~s~0)|)) (or .cse4 .cse0 .cse1 .cse2) (or .cse0 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point L21678-1(line 21678) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 21702 21714) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 21702 21714) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point L21683(lines 21683 21689) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L444 ceAbstractionStarter]: At program point L21695(lines 21694 21717) the Hoare annotation is: (let ((.cse2 (= ~compRegistered~0 0))) (let ((.cse0 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (not .cse2)) (.cse5 (not (= 3 |old(~s~0)|))) (.cse6 (not (= ~customIrp~0 0)))) (and (or (and (= 0 (+ IofCallDriver_~__cil_tmp9~27 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5)) (or .cse0 (or .cse1 .cse2 (not (= 1 |old(~s~0)|))))) (or .cse3 (or .cse4 .cse1 .cse5) .cse6) (or .cse0 .cse4 .cse1 (= 3 ~s~0) .cse5) (or .cse3 .cse4 .cse5 .cse6 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point L21675(lines 21675 21693) no Hoare annotation was computed. [2018-11-23 01:35:18,455 INFO L448 ceAbstractionStarter]: For program point L21675-1(lines 21674 21742) no Hoare annotation was computed. [2018-11-23 01:35:18,456 INFO L444 ceAbstractionStarter]: At program point L4858(line 4858) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,466 INFO L448 ceAbstractionStarter]: For program point L4858-1(lines 4744 4860) no Hoare annotation was computed. [2018-11-23 01:35:18,466 INFO L444 ceAbstractionStarter]: At program point L4817(line 4817) the Hoare annotation is: (or (= 0 ~pended~0) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,466 INFO L448 ceAbstractionStarter]: For program point L4817-1(line 4817) no Hoare annotation was computed. [2018-11-23 01:35:18,467 INFO L448 ceAbstractionStarter]: For program point L4813(line 4813) no Hoare annotation was computed. [2018-11-23 01:35:18,467 INFO L444 ceAbstractionStarter]: At program point L4801(line 4801) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,467 INFO L448 ceAbstractionStarter]: For program point L4801-1(line 4801) no Hoare annotation was computed. [2018-11-23 01:35:18,467 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 4527 4913) no Hoare annotation was computed. [2018-11-23 01:35:18,467 INFO L444 ceAbstractionStarter]: At program point L4760(line 4760) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,467 INFO L444 ceAbstractionStarter]: At program point L4723(lines 4718 4724) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,467 INFO L448 ceAbstractionStarter]: For program point L4847(lines 4847 4851) no Hoare annotation was computed. [2018-11-23 01:35:18,467 INFO L444 ceAbstractionStarter]: At program point L4843(line 4843) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,467 INFO L448 ceAbstractionStarter]: For program point L4843-1(line 4843) no Hoare annotation was computed. [2018-11-23 01:35:18,467 INFO L444 ceAbstractionStarter]: At program point L4909(line 4909) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,467 INFO L448 ceAbstractionStarter]: For program point L4909-1(line 4909) no Hoare annotation was computed. [2018-11-23 01:35:18,467 INFO L444 ceAbstractionStarter]: At program point L4839(line 4839) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,467 INFO L448 ceAbstractionStarter]: For program point L4839-1(line 4839) no Hoare annotation was computed. [2018-11-23 01:35:18,467 INFO L444 ceAbstractionStarter]: At program point L4905(line 4905) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,477 INFO L448 ceAbstractionStarter]: For program point L4744(lines 4744 4860) no Hoare annotation was computed. [2018-11-23 01:35:18,477 INFO L448 ceAbstractionStarter]: For program point L4905-1(line 4905) no Hoare annotation was computed. [2018-11-23 01:35:18,477 INFO L444 ceAbstractionStarter]: At program point L4835(lines 4835 4836) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,477 INFO L448 ceAbstractionStarter]: For program point L4835-1(lines 4835 4836) no Hoare annotation was computed. [2018-11-23 01:35:18,477 INFO L444 ceAbstractionStarter]: At program point L4695(lines 4690 4696) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,477 INFO L444 ceAbstractionStarter]: At program point L4790(lines 4790 4791) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,477 INFO L448 ceAbstractionStarter]: For program point L4757(lines 4757 4764) no Hoare annotation was computed. [2018-11-23 01:35:18,477 INFO L448 ceAbstractionStarter]: For program point L4790-1(lines 4790 4791) no Hoare annotation was computed. [2018-11-23 01:35:18,477 INFO L444 ceAbstractionStarter]: At program point L4757-1(lines 4757 4764) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,477 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 4527 4913) no Hoare annotation was computed. [2018-11-23 01:35:18,477 INFO L448 ceAbstractionStarter]: For program point L4683(lines 4683 4710) no Hoare annotation was computed. [2018-11-23 01:35:18,477 INFO L444 ceAbstractionStarter]: At program point L4716-1(lines 4716 4722) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,477 INFO L444 ceAbstractionStarter]: At program point L4716(line 4716) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,477 INFO L444 ceAbstractionStarter]: At program point L4807(line 4807) the Hoare annotation is: (or (= 0 ~pended~0) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,477 INFO L448 ceAbstractionStarter]: For program point L4807-1(line 4807) no Hoare annotation was computed. [2018-11-23 01:35:18,477 INFO L444 ceAbstractionStarter]: At program point L4675(line 4675) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,491 INFO L448 ceAbstractionStarter]: For program point L4675-1(line 4675) no Hoare annotation was computed. [2018-11-23 01:35:18,491 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 4527 4913) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,491 INFO L448 ceAbstractionStarter]: For program point L4766(line 4766) no Hoare annotation was computed. [2018-11-23 01:35:18,491 INFO L448 ceAbstractionStarter]: For program point L4795(lines 4795 4822) no Hoare annotation was computed. [2018-11-23 01:35:18,491 INFO L444 ceAbstractionStarter]: At program point L4890(line 4890) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,491 INFO L448 ceAbstractionStarter]: For program point L4886(lines 4886 4892) no Hoare annotation was computed. [2018-11-23 01:35:18,492 INFO L444 ceAbstractionStarter]: At program point L4729(line 4729) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,492 INFO L448 ceAbstractionStarter]: For program point L4890-1(lines 4886 4892) no Hoare annotation was computed. [2018-11-23 01:35:18,492 INFO L448 ceAbstractionStarter]: For program point L4729-1(line 4729) no Hoare annotation was computed. [2018-11-23 01:35:18,492 INFO L444 ceAbstractionStarter]: At program point L4754(line 4754) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,492 INFO L444 ceAbstractionStarter]: At program point L4688-1(lines 4688 4694) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,492 INFO L448 ceAbstractionStarter]: For program point L4754-1(line 4754) no Hoare annotation was computed. [2018-11-23 01:35:18,492 INFO L444 ceAbstractionStarter]: At program point L4688(line 4688) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,492 INFO L444 ceAbstractionStarter]: At program point L4804-2(lines 4804 4811) the Hoare annotation is: (or (= 0 ~pended~0) (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-11-23 01:35:18,492 INFO L448 ceAbstractionStarter]: For program point L4804(lines 4804 4811) no Hoare annotation was computed. [2018-11-23 01:35:18,492 INFO L448 ceAbstractionStarter]: For program point L5948-1(line 5948) no Hoare annotation was computed. [2018-11-23 01:35:18,492 INFO L451 ceAbstractionStarter]: At program point L5948(line 5948) the Hoare annotation is: true [2018-11-23 01:35:18,492 INFO L448 ceAbstractionStarter]: For program point L5684(lines 5684 6667) no Hoare annotation was computed. [2018-11-23 01:35:18,492 INFO L451 ceAbstractionStarter]: At program point L6576(lines 6571 6577) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L6444(line 6444) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L6246loopEntry(lines 6246 6249) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L6312(lines 6312 6317) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L6180-2(lines 6180 6267) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L6081(lines 6076 6082) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L5685(lines 5684 6667) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L6181(line 6181) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L5950(lines 5950 5962) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L6710(line 6710) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L5687(lines 5687 6666) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L6678(lines 6678 6717) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L6678-1(lines 6678 6717) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L6414(line 6414) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L6513(line 6513) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L6018(lines 6018 6047) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L6084(line 6084) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L5985(lines 5985 5990) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L5952loopEntry(lines 5952 5955) the Hoare annotation is: true [2018-11-23 01:35:18,501 INFO L448 ceAbstractionStarter]: For program point L6679(lines 6679 6707) no Hoare annotation was computed. [2018-11-23 01:35:18,501 INFO L451 ceAbstractionStarter]: At program point L5688(lines 5687 6666) the Hoare annotation is: true [2018-11-23 01:35:18,502 INFO L451 ceAbstractionStarter]: At program point L6613(lines 5717 6656) the Hoare annotation is: true [2018-11-23 01:35:18,502 INFO L451 ceAbstractionStarter]: At program point L6250(lines 6245 6251) the Hoare annotation is: true [2018-11-23 01:35:18,502 INFO L451 ceAbstractionStarter]: At program point L6349-1(line 6349) the Hoare annotation is: true [2018-11-23 01:35:18,502 INFO L451 ceAbstractionStarter]: At program point L6349(line 6349) the Hoare annotation is: true [2018-11-23 01:35:18,502 INFO L451 ceAbstractionStarter]: At program point L5557(line 5557) the Hoare annotation is: true [2018-11-23 01:35:18,502 INFO L448 ceAbstractionStarter]: For program point L5557-1(line 5557) no Hoare annotation was computed. [2018-11-23 01:35:18,502 INFO L448 ceAbstractionStarter]: For program point L6350(line 6350) no Hoare annotation was computed. [2018-11-23 01:35:18,502 INFO L451 ceAbstractionStarter]: At program point L6053(lines 5693 6664) the Hoare annotation is: true [2018-11-23 01:35:18,502 INFO L448 ceAbstractionStarter]: For program point L5690(lines 5690 6665) no Hoare annotation was computed. [2018-11-23 01:35:18,502 INFO L448 ceAbstractionStarter]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L6285(lines 6285 6555) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L6153-2(lines 6153 6171) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L6153(lines 6153 6171) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L6186-1(lines 6186 6190) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L5823(lines 5823 5840) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L6682(lines 6682 6706) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L451 ceAbstractionStarter]: At program point L5890(line 5890) the Hoare annotation is: true [2018-11-23 01:35:18,516 INFO L451 ceAbstractionStarter]: At program point L5956(lines 5951 5957) the Hoare annotation is: true [2018-11-23 01:35:18,516 INFO L451 ceAbstractionStarter]: At program point L5890-1(line 5890) the Hoare annotation is: true [2018-11-23 01:35:18,516 INFO L451 ceAbstractionStarter]: At program point L6650(line 6650) the Hoare annotation is: true [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L6584(lines 6584 6596) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L6650-1(line 6650) no Hoare annotation was computed. [2018-11-23 01:35:18,516 INFO L451 ceAbstractionStarter]: At program point L6287loopEntry(lines 6287 6290) the Hoare annotation is: true [2018-11-23 01:35:18,516 INFO L451 ceAbstractionStarter]: At program point L6155loopEntry(lines 6155 6158) the Hoare annotation is: true [2018-11-23 01:35:18,516 INFO L448 ceAbstractionStarter]: For program point L5891(line 5891) no Hoare annotation was computed. [2018-11-23 01:35:18,517 INFO L451 ceAbstractionStarter]: At program point L6618(line 6618) the Hoare annotation is: true [2018-11-23 01:35:18,517 INFO L448 ceAbstractionStarter]: For program point L5693(lines 5693 6664) no Hoare annotation was computed. [2018-11-23 01:35:18,517 INFO L448 ceAbstractionStarter]: For program point L6618-1(lines 6614 6620) no Hoare annotation was computed. [2018-11-23 01:35:18,517 INFO L451 ceAbstractionStarter]: At program point L6586loopEntry(lines 6586 6589) the Hoare annotation is: true [2018-11-23 01:35:18,517 INFO L448 ceAbstractionStarter]: For program point L6685(lines 6685 6705) no Hoare annotation was computed. [2018-11-23 01:35:18,517 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 4947 6727) no Hoare annotation was computed. [2018-11-23 01:35:18,517 INFO L451 ceAbstractionStarter]: At program point L5728loopEntry(lines 5728 5731) the Hoare annotation is: true [2018-11-23 01:35:18,517 INFO L448 ceAbstractionStarter]: For program point L6455(lines 6455 6464) no Hoare annotation was computed. [2018-11-23 01:35:18,517 INFO L448 ceAbstractionStarter]: For program point L6323-1(lines 6323 6324) no Hoare annotation was computed. [2018-11-23 01:35:18,517 INFO L451 ceAbstractionStarter]: At program point L6323(lines 6323 6324) the Hoare annotation is: true [2018-11-23 01:35:18,517 INFO L448 ceAbstractionStarter]: For program point L6389-1(lines 6389 6391) no Hoare annotation was computed. [2018-11-23 01:35:18,517 INFO L451 ceAbstractionStarter]: At program point L6389(lines 6389 6391) the Hoare annotation is: true [2018-11-23 01:35:18,517 INFO L451 ceAbstractionStarter]: At program point L5795(line 5795) the Hoare annotation is: true [2018-11-23 01:35:18,517 INFO L451 ceAbstractionStarter]: At program point L5795-1(line 5795) the Hoare annotation is: true [2018-11-23 01:35:18,534 INFO L451 ceAbstractionStarter]: At program point L6654(lines 5533 6726) the Hoare annotation is: true [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5630(lines 5630 5672) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5696(lines 5696 6663) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5564-2(lines 5564 5591) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5564(lines 5564 5591) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L451 ceAbstractionStarter]: At program point L6291(lines 6286 6292) the Hoare annotation is: true [2018-11-23 01:35:18,534 INFO L451 ceAbstractionStarter]: At program point L6159(lines 6154 6160) the Hoare annotation is: true [2018-11-23 01:35:18,534 INFO L451 ceAbstractionStarter]: At program point L6093(lines 5708 6659) the Hoare annotation is: true [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5862(lines 5862 5872) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5928(lines 5928 5940) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5796(line 5796) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5631(lines 5631 5637) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L451 ceAbstractionStarter]: At program point L5598(line 5598) the Hoare annotation is: true [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L6688(lines 6688 6704) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L6523-1(line 6523) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L451 ceAbstractionStarter]: At program point L6523(line 6523) the Hoare annotation is: true [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L5598-1(line 5598) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L451 ceAbstractionStarter]: At program point L6061(lines 5696 6663) the Hoare annotation is: true [2018-11-23 01:35:18,534 INFO L448 ceAbstractionStarter]: For program point L6028(lines 6028 6045) no Hoare annotation was computed. [2018-11-23 01:35:18,534 INFO L451 ceAbstractionStarter]: At program point L6590(lines 6585 6591) the Hoare annotation is: true [2018-11-23 01:35:18,535 INFO L451 ceAbstractionStarter]: At program point L6557(lines 5714 6657) the Hoare annotation is: true [2018-11-23 01:35:18,535 INFO L448 ceAbstractionStarter]: For program point L6425(lines 6425 6468) no Hoare annotation was computed. [2018-11-23 01:35:18,535 INFO L451 ceAbstractionStarter]: At program point L5930loopEntry(lines 5930 5933) the Hoare annotation is: true [2018-11-23 01:35:18,535 INFO L448 ceAbstractionStarter]: For program point L5699(lines 5699 6662) no Hoare annotation was computed. [2018-11-23 01:35:18,535 INFO L451 ceAbstractionStarter]: At program point L5732(lines 5727 5733) the Hoare annotation is: true [2018-11-23 01:35:18,535 INFO L451 ceAbstractionStarter]: At program point L6459(line 6459) the Hoare annotation is: true [2018-11-23 01:35:18,535 INFO L448 ceAbstractionStarter]: For program point L6525-1(line 6525) no Hoare annotation was computed. [2018-11-23 01:35:18,535 INFO L451 ceAbstractionStarter]: At program point L6525(line 6525) the Hoare annotation is: true [2018-11-23 01:35:18,535 INFO L448 ceAbstractionStarter]: For program point L6327(lines 6327 6332) no Hoare annotation was computed. [2018-11-23 01:35:18,535 INFO L451 ceAbstractionStarter]: At program point L5667(line 5667) the Hoare annotation is: true [2018-11-23 01:35:18,549 INFO L448 ceAbstractionStarter]: For program point L5667-1(line 5667) no Hoare annotation was computed. [2018-11-23 01:35:18,549 INFO L448 ceAbstractionStarter]: For program point L6691(lines 6691 6703) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L5535loopEntry(lines 5535 5538) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L6130(lines 6130 6142) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L5767(lines 5767 5777) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L5833(lines 5833 5838) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L5635(line 5635) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L5635-1(lines 5631 5637) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L6395(lines 6395 6403) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L5702(lines 5702 6661) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L6429(line 6429) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L6132loopEntry(lines 6132 6135) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L5934(lines 5929 5935) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L6694(lines 6694 6702) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L6100loopEntry(lines 6100 6103) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 4947 6727) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L5539(lines 5534 5540) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L5605(lines 5605 5622) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L6398(line 6398) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L6299(lines 6299 6304) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L5705(lines 5705 6660) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L6069(lines 5699 6662) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L5706(lines 5705 6660) the Hoare annotation is: true [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L6697-2(lines 6678 6715) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L6697(lines 6697 6701) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L448 ceAbstractionStarter]: For program point L6367-1(line 6367) no Hoare annotation was computed. [2018-11-23 01:35:18,550 INFO L451 ceAbstractionStarter]: At program point L6367(line 6367) the Hoare annotation is: true [2018-11-23 01:35:18,551 INFO L451 ceAbstractionStarter]: At program point L6136(lines 6131 6137) the Hoare annotation is: true [2018-11-23 01:35:18,551 INFO L448 ceAbstractionStarter]: For program point L5740(lines 5740 5745) no Hoare annotation was computed. [2018-11-23 01:35:18,564 INFO L451 ceAbstractionStarter]: At program point L6599loopEntry(lines 6599 6602) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L6533-1(line 6533) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L6533(line 6533) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L6038(lines 6038 6043) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L6104(lines 6099 6105) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L5708(lines 5708 6659) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L6534(line 6534) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point $Ultimate##43(lines 5719 6655) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point $Ultimate##42(lines 5719 6655) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L5576(lines 5576 5587) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L6336-1(line 6336) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L6336(line 6336) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L5578(line 5578) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L5578-1(line 5578) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L5711(lines 5711 6658) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L6570(lines 6570 6611) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L6603(lines 6598 6604) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L6504(lines 6504 6518) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L5976(lines 5976 6051) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L6670(lines 6670 6724) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L5712(lines 5711 6658) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 4947 6727) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L6572loopEntry(lines 6572 6575) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L448 ceAbstractionStarter]: For program point L6440(lines 6440 6466) no Hoare annotation was computed. [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L6077loopEntry(lines 6077 6080) the Hoare annotation is: true [2018-11-23 01:35:18,565 INFO L451 ceAbstractionStarter]: At program point L5912(lines 5690 6665) the Hoare annotation is: true [2018-11-23 01:35:18,566 INFO L448 ceAbstractionStarter]: For program point L5714(lines 5714 6657) no Hoare annotation was computed. [2018-11-23 01:35:18,566 INFO L448 ceAbstractionStarter]: For program point L6606(line 6606) no Hoare annotation was computed. [2018-11-23 01:35:18,566 INFO L451 ceAbstractionStarter]: At program point L5582(line 5582) the Hoare annotation is: true [2018-11-23 01:35:18,581 INFO L448 ceAbstractionStarter]: For program point L5681(lines 5681 6668) no Hoare annotation was computed. [2018-11-23 01:35:18,581 INFO L448 ceAbstractionStarter]: For program point L5582-1(line 5582) no Hoare annotation was computed. [2018-11-23 01:35:18,581 INFO L451 ceAbstractionStarter]: At program point L5682(lines 5681 6668) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point L5815(lines 5810 5816) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point L5617(line 5617) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L5617-1(line 5617) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L6410(lines 6410 6470) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point ExReleaseFastMutexFINAL(lines 21164 21170) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point ExReleaseFastMutexENTRY(lines 21164 21170) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point ExReleaseFastMutexEXIT(lines 21164 21170) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,582 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-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 9 14) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 9 14) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 9 14) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point L20342(line 20342) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L20342-1(line 20342) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point L20466(line 20466) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L20383(lines 20383 20414) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L20379-1(line 20379) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point L20379(line 20379) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L20400(lines 20400 20407) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L20466-1(line 20466) no Hoare annotation was computed. [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point L20400-2(lines 20400 20407) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L451 ceAbstractionStarter]: At program point L20396(line 20396) the Hoare annotation is: true [2018-11-23 01:35:18,582 INFO L448 ceAbstractionStarter]: For program point L20363-1(line 20363) no Hoare annotation was computed. [2018-11-23 01:35:18,597 INFO L451 ceAbstractionStarter]: At program point L20363(line 20363) the Hoare annotation is: true [2018-11-23 01:35:18,597 INFO L451 ceAbstractionStarter]: At program point L20396-1(line 20396) the Hoare annotation is: true [2018-11-23 01:35:18,597 INFO L448 ceAbstractionStarter]: For program point L20409(line 20409) no Hoare annotation was computed. [2018-11-23 01:35:18,597 INFO L451 ceAbstractionStarter]: At program point L20417(lines 20370 20470) the Hoare annotation is: true [2018-11-23 01:35:18,597 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 20268 20475) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L20451-1(lines 20447 20453) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point L20451(line 20451) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L20397(line 20397) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L20447(lines 20447 20453) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point L20348(line 20348) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 20268 20475) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 20268 20475) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point L20345-1(lines 20345 20352) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L20345(lines 20345 20352) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L20370(lines 20370 20470) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L20403-1(line 20403) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point L20403(line 20403) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L20354(line 20354) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L20370-1(lines 20370 20470) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 21174 21188) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 21174 21188) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 21174 21188) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point L21183(line 21183) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L21183-1(line 21183) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point L4352(lines 4351 4375) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L451 ceAbstractionStarter]: At program point L4346(lines 4345 4377) the Hoare annotation is: true [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L4348(lines 4348 4376) no Hoare annotation was computed. [2018-11-23 01:35:18,598 INFO L448 ceAbstractionStarter]: For program point L4342(lines 4342 4378) no Hoare annotation was computed. [2018-11-23 01:35:18,599 INFO L451 ceAbstractionStarter]: At program point L4373(lines 4353 4374) the Hoare annotation is: true [2018-11-23 01:35:18,606 INFO L451 ceAbstractionStarter]: At program point L4340(lines 4339 4379) the Hoare annotation is: true [2018-11-23 01:35:18,606 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 4177 4520) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point L4336(lines 4336 4380) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 4353 4374) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point $Ultimate##13(lines 4353 4374) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L451 ceAbstractionStarter]: At program point L4349(lines 4348 4376) the Hoare annotation is: true [2018-11-23 01:35:18,607 INFO L451 ceAbstractionStarter]: At program point L4343(lines 4342 4378) the Hoare annotation is: true [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point L4345(lines 4345 4377) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point L4339(lines 4339 4379) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L451 ceAbstractionStarter]: At program point L4337(lines 4336 4380) the Hoare annotation is: true [2018-11-23 01:35:18,607 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 4177 4520) the Hoare annotation is: true [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point L4323(lines 4323 4327) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 4177 4520) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,607 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-11-23 01:35:18,607 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 22268 22288) the Hoare annotation is: true [2018-11-23 01:35:18,607 INFO L451 ceAbstractionStarter]: At program point L22273(lines 22272 22286) the Hoare annotation is: true [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point L22272(lines 22272 22286) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 22268 22288) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L451 ceAbstractionStarter]: At program point L22276(lines 22275 22285) the Hoare annotation is: true [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 22277 22284) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point L22283(lines 22268 22288) no Hoare annotation was computed. [2018-11-23 01:35:18,607 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 22277 22284) no Hoare annotation was computed. [2018-11-23 01:35:18,623 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,623 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,628 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,628 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,628 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,630 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,630 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,631 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,631 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,631 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,631 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,632 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,637 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,638 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,647 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,647 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,647 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,648 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,648 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,648 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,648 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,648 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,649 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,649 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,649 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,650 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,650 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,650 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,650 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,651 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,653 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,654 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,654 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,654 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,654 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,655 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,659 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,660 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,660 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,660 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,661 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:18,662 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:18,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:35:18 BoogieIcfgContainer [2018-11-23 01:35:18,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:35:18,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:35:18,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:35:18,670 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:35:18,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:17" (3/4) ... [2018-11-23 01:35:18,675 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoGetConfigurationInformation [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedInsertTailList [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlInitUnicodeString [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoStartNextPowerIrp [2018-11-23 01:35:18,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExFreePool [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DriverEntry [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetHardErrorOrVerifyDevice [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDetachDevice [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 01:35:18,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure MmResetDriverPaging [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyReadWrite [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObfDereferenceObject [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeInitializeEvent [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedRemoveHeadList [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPower [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlFreeUnicodeString [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeReleaseSemaphore [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyUnload [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 01:35:18,686 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedExchange [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure MmPageEntireDriver [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlDeleteRegistryValue [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteDevice [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAcquireFastMutex [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlQueryRegistryValues [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-23 01:35:18,687 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExReleaseFastMutex [2018-11-23 01:35:18,688 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 01:35:18,688 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_guard [2018-11-23 01:35:18,688 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-23 01:35:18,688 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-11-23 01:35:18,688 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-23 01:35:18,688 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-23 01:35:18,761 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 640 nodes and edges [2018-11-23 01:35:18,767 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 314 nodes and edges [2018-11-23 01:35:18,774 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 146 nodes and edges [2018-11-23 01:35:18,782 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2018-11-23 01:35:18,786 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-11-23 01:35:18,790 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 01:35:18,793 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 01:35:18,796 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 01:35:18,799 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 01:35:18,827 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && 2 == s) && #funAddr~FloppyPnp.base == __cil_tmp18) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (((status == lowerDriverReturn && (((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == compRegistered) && #funAddr~FloppyPnp.base == __cil_tmp18) && s == 4) && 0 == customIrp) && __cil_tmp14 == 1)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || 0 == s) || (((status == lowerDriverReturn && (((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount) && 0 == customIrp) && __cil_tmp14 == 1)) || !(\old(compRegistered) == 0)) || ((((((((!(__BLAST_NONDET == 2) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && #funAddr~FloppyPnp.offset == __cil_tmp18) && !(0 == compRegistered)) && 6 == s) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(0 == \old(pended))) || 1 == s) || !(\old(customIrp) == 0) [2018-11-23 01:35:18,827 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == compRegistered) && #funAddr~FloppyPnp.base == __cil_tmp18) && s == 4) || ((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && status == lowerDriverReturn) && 0 == customIrp) && __cil_tmp14 == 1) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && 2 == s) && #funAddr~FloppyPnp.base == __cil_tmp18) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || 0 == s) || !(\old(compRegistered) == 0)) || ((((((((!(__BLAST_NONDET == 2) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && #funAddr~FloppyPnp.offset == __cil_tmp18) && !(0 == compRegistered)) && 6 == s) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(0 == \old(pended))) || 1 == s) || !(\old(customIrp) == 0) [2018-11-23 01:35:18,827 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && 2 == s) && #funAddr~FloppyPnp.base == __cil_tmp18) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || ((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == compRegistered) && #funAddr~FloppyPnp.base == __cil_tmp18) && s == 4) || ((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && !(6 == s)) && !(s == 2)) && !(0 == compRegistered)) && #funAddr~FloppyPnp.base == __cil_tmp18) && 1 == setEventCalled) && 0 == PagingReferenceCount)) && status == lowerDriverReturn) && 0 == customIrp) && __cil_tmp14 == 1)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0) [2018-11-23 01:35:18,828 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled)) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) && ((customIrp == \old(customIrp) && 1 == s) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0)) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (1 == s && 0 == customIrp)) || !(\old(customIrp) == 0))) && ((((!(compRegistered == 0) || (1 == s && 0 == customIrp)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) [2018-11-23 01:35:18,828 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled)) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) && ((customIrp == \old(customIrp) && 1 == s) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0)) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (1 == s && 0 == customIrp)) || !(\old(customIrp) == 0))) && ((((!(compRegistered == 0) || (1 == s && 0 == customIrp)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) [2018-11-23 01:35:18,828 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5) || !(PagingReferenceCount == 1) || (!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) && ((s == \old(s) || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((s == \old(s) || !(compRegistered == 0)) || !(3 == \old(s))) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-11-23 01:35:18,828 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) && (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) [2018-11-23 01:35:18,829 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((6 == s && ((0 == pended && !(0 == compRegistered)) && 1 == setEventCalled) && PagingReferenceCount == 1) || (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && 2 == s)) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (!(ntStatus == 259) && (0 == pended && 2 == s) && PagingReferenceCount == 1)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && PagingReferenceCount == 1) && s == 4)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && 0 == customIrp) && s == 4)) || ((((0 == compRegistered && lowerDriverReturn == ntStatus) && 0 == customIrp) && !(PagingReferenceCount % 4294967296 == 0)) && s == 4)) || (((0 == compRegistered && !(ntStatus == 259)) && 2 == s) && !(PagingReferenceCount % 4294967296 == 0)) [2018-11-23 01:35:18,829 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(PagingReferenceCount == 1) || 3 == s) || !(compRegistered == 0)) || !(0 == pended)) || !(3 == \old(s))) && ((s == \old(s) || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0))) && ((((((0 == __cil_tmp9 + 1073741802 && returnVal2 + 1073741823 <= 0) && 1 == setEventCalled) && s == 5) || (((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && returnVal2 == 259) && s == 5)) || !(PagingReferenceCount == 1) || (!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || (((0 == __cil_tmp9 + 1073741802 && 0 == returnVal2) && 1 == setEventCalled) && s == 5))) && ((((s == \old(s) || !(compRegistered == 0)) || !(3 == \old(s))) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-11-23 01:35:18,829 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5) || !(PagingReferenceCount == 1) || (!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) && ((s == \old(s) || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((s == \old(s) || !(compRegistered == 0)) || !(3 == \old(s))) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-11-23 01:35:18,829 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5) || !(PagingReferenceCount == 1) || (!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) && ((s == \old(s) || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((s == \old(s) || !(compRegistered == 0)) || !(3 == \old(s))) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-11-23 01:35:18,829 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-11-23 01:35:18,830 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)) && (((((0 == pended && customIrp == \old(customIrp)) && !(0 == compRegistered)) && 1 == s) && 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)))) && (((((((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) [2018-11-23 01:35:18,830 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-11-23 01:35:18,830 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((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))) && ((((((((((((0 == pended && 0 == compRegistered) && __cil_tmp17 == 0) && 0 == customIrp) && headOfList == 0) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)))) && (((0 == myStatus || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || !(\old(customIrp) == 0))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s))) [2018-11-23 01:35:18,831 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || ((((0 == pended && 0 == compRegistered) && 1 == s) && __cil_tmp14 == 1) && 0 < status + 1)) || !(\old(customIrp) == 0) [2018-11-23 01:35:18,831 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || (((((((!(__BLAST_NONDET == 2) && 0 == pended) && 0 == compRegistered) && status == 0) && 0 == customIrp) && 1 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) [2018-11-23 01:35:18,832 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || (((!(__BLAST_NONDET == 2) && 0 == pended) && 0 == compRegistered) && 1 == s)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-11-23 01:35:18,833 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) [2018-11-23 01:35:18,833 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) [2018-11-23 01:35:18,833 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && 2 == s) && #funAddr~FloppyPnp.base == __cil_tmp18) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status)) || ((((((((!(__BLAST_NONDET == 2) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && #funAddr~FloppyPnp.offset == __cil_tmp18) && 6 == s) && !(0 == compRegistered)) && 1 == setEventCalled) && __cil_tmp14 == 1) && 0 == PagingReferenceCount)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (((status == lowerDriverReturn && (((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == compRegistered) && #funAddr~FloppyPnp.base == __cil_tmp18) && s == 4) && 0 == customIrp) && __cil_tmp14 == 1)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || (((status == lowerDriverReturn && (((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount) && 0 == customIrp) && __cil_tmp14 == 1)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || 1 == s) || !(\old(customIrp) == 0) [2018-11-23 01:35:18,834 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) [2018-11-23 01:35:18,834 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) [2018-11-23 01:35:18,836 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) [2018-11-23 01:35:18,836 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) [2018-11-23 01:35:18,838 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) && ((((!(compRegistered == 0) || (s == \old(s) && 0 == customIrp)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0)) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (s == \old(s) && 0 == customIrp)) || !(\old(customIrp) == 0))) && (((customIrp == \old(customIrp) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) [2018-11-23 01:35:18,841 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-11-23 01:35:18,842 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))) || (!(ntStatus == 259) && ((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1)) || (0 == InterfaceType && ((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) [2018-11-23 01:35:18,842 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-11-23 01:35:18,842 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))) || (!(ntStatus == 259) && ((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) [2018-11-23 01:35:18,843 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-11-23 01:35:18,843 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 0 == myStatus) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-11-23 01:35:18,843 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-11-23 01:35:18,843 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-11-23 01:35:18,843 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-11-23 01:35:18,843 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-11-23 01:35:18,843 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-11-23 01:35:18,843 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-11-23 01:35:18,844 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-11-23 01:35:18,844 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-11-23 01:35:18,848 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) [2018-11-23 01:35:18,848 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-11-23 01:35:18,849 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) [2018-11-23 01:35:18,849 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 0 == myStatus) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-11-23 01:35:18,849 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 0 == myStatus) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-11-23 01:35:18,849 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 0 == myStatus) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-11-23 01:35:18,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) && (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) [2018-11-23 01:35:18,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) && (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) [2018-11-23 01:35:18,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) && (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) [2018-11-23 01:35:18,851 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == customIrp && 1 == s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) [2018-11-23 01:35:18,851 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == customIrp && 1 == s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) [2018-11-23 01:35:18,851 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)) && 1 == s) && PagingReferenceCount == 1) && ntStatus <= 0) [2018-11-23 01:35:18,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-11-23 01:35:18,877 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-11-23 01:35:18,877 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-11-23 01:35:18,877 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-11-23 01:35:18,879 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-11-23 01:35:18,879 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-11-23 01:35:19,179 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_34edd432-ec7d-4c41-a042-90880cd6aca8/bin-2019/uautomizer/witness.graphml [2018-11-23 01:35:19,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:35:19,180 INFO L168 Benchmark]: Toolchain (without parser) took 195116.67 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 931.9 MB in the beginning and 596.0 MB in the end (delta: 336.0 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-23 01:35:19,181 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:35:19,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2486.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 931.9 MB in the beginning and 1.0 GB in the end (delta: -95.7 MB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:35:19,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:35:19,181 INFO L168 Benchmark]: Boogie Preprocessor took 164.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 984.9 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:35:19,182 INFO L168 Benchmark]: RCFGBuilder took 10267.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.2 MB). Free memory was 984.9 MB in the beginning and 935.5 MB in the end (delta: 49.4 MB). Peak memory consumption was 249.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:35:19,182 INFO L168 Benchmark]: TraceAbstraction took 181584.09 ms. Allocated memory was 1.3 GB in the beginning and 4.6 GB in the end (delta: 3.3 GB). Free memory was 935.5 MB in the beginning and 794.0 MB in the end (delta: 141.5 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-23 01:35:19,182 INFO L168 Benchmark]: Witness Printer took 509.41 ms. Allocated memory is still 4.6 GB. Free memory was 794.0 MB in the beginning and 596.0 MB in the end (delta: 198.1 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:35:19,184 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2486.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 931.9 MB in the beginning and 1.0 GB in the end (delta: -95.7 MB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 164.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 984.9 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 10267.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.2 MB). Free memory was 984.9 MB in the beginning and 935.5 MB in the end (delta: 49.4 MB). Peak memory consumption was 249.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 181584.09 ms. Allocated memory was 1.3 GB in the beginning and 4.6 GB in the end (delta: 3.3 GB). Free memory was 935.5 MB in the beginning and 794.0 MB in the end (delta: 141.5 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 509.41 ms. Allocated memory is still 4.6 GB. Free memory was 794.0 MB in the beginning and 596.0 MB in the end (delta: 198.1 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4523]: 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: 6571]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5693]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21700]: Loop Invariant Derived loop invariant: (((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5) || !(PagingReferenceCount == 1) || (!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) && ((s == \old(s) || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((s == \old(s) || !(compRegistered == 0)) || !(3 == \old(s))) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 4690]: Loop Invariant Derived loop invariant: (((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s) - InvariantResult [Line: 4351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8216]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 6287]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8858]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9065]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7153]: 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: 6155]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7220]: 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: 6585]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22250]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5714]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7254]: 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: 21003]: 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: 6246]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22253]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8846]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5711]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4718]: Loop Invariant Derived loop invariant: (((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s) - InvariantResult [Line: 2887]: Loop Invariant Derived loop invariant: (((((0 == ntStatus || !(myStatus == 0)) || !(0 == s)) || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(customIrp == 0) - InvariantResult [Line: 22275]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21092]: Loop Invariant [2018-11-23 01:35:19,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base Derived loop invariant: ((((((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && 2 == s) && #funAddr~FloppyPnp.base == __cil_tmp18) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || ((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == compRegistered) && #funAddr~FloppyPnp.base == __cil_tmp18) && s == 4) || ((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && !(6 == s)) && !(s == 2)) && !(0 == compRegistered)) && #funAddr~FloppyPnp.base == __cil_tmp18) && 1 == setEventCalled) && 0 == PagingReferenceCount)) && status == lowerDriverReturn) && 0 == customIrp) && __cil_tmp14 == 1)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0) - InvariantResult [Line: 8753]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6076]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22272]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6180]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21000]: 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: 8798]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8353]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (!(ntStatus == 259) && ((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 20790]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) && (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) - InvariantResult [Line: 5681]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3021]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21595]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8747]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21567]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21006]: Loop Invariant Derived loop invariant: (((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || ((((0 == pended && 0 == compRegistered) && 1 == s) && __cil_tmp14 == 1) && 0 < status + 1)) || !(\old(customIrp) == 0) - InvariantResult [Line: 5534]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21979]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20967]: Loop Invariant [2018-11-23 01:35:19,196 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,196 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,196 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,196 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,196 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,198 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,198 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,198 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,198 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,198 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,198 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base Derived loop invariant: ((((((((((((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && 2 == s) && #funAddr~FloppyPnp.base == __cil_tmp18) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status)) || ((((((((!(__BLAST_NONDET == 2) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && #funAddr~FloppyPnp.offset == __cil_tmp18) && 6 == s) && !(0 == compRegistered)) && 1 == setEventCalled) && __cil_tmp14 == 1) && 0 == PagingReferenceCount)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (((status == lowerDriverReturn && (((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == compRegistered) && #funAddr~FloppyPnp.base == __cil_tmp18) && s == 4) && 0 == customIrp) && __cil_tmp14 == 1)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || (((status == lowerDriverReturn && (((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount) && 0 == customIrp) && __cil_tmp14 == 1)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || 1 == s) || !(\old(customIrp) == 0) - InvariantResult [Line: 4924]: Loop Invariant Derived loop invariant: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) - InvariantResult [Line: 7445]: Loop Invariant Derived loop invariant: ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 0 == myStatus) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5684]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5952]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8845]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7232]: 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: 5533]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22012]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20691]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) && (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) - InvariantResult [Line: 21564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8461]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) && ntStatus <= 0) - InvariantResult [Line: 8750]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9168]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21848]: Loop Invariant Derived loop invariant: ((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) && ((((!(compRegistered == 0) || (s == \old(s) && 0 == customIrp)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0)) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (s == \old(s) && 0 == customIrp)) || !(\old(customIrp) == 0))) && (((customIrp == \old(customIrp) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) - InvariantResult [Line: 9251]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6599]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5727]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7715]: 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: 7453]: Loop Invariant Derived loop invariant: ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 0 == myStatus) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 22104]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9273]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5687]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7226]: Loop Invariant Derived loop invariant: ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 0 == myStatus) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9064]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4688]: Loop Invariant Derived loop invariant: (((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s) - InvariantResult [Line: 5717]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8712]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21009]: Loop Invariant Derived loop invariant: (((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || (((((((!(__BLAST_NONDET == 2) && 0 == pended) && 0 == compRegistered) && status == 0) && 0 == customIrp) && 1 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) - InvariantResult [Line: 6286]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19959]: Loop Invariant Derived loop invariant: (0 == customIrp && 1 == s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 21674]: Loop Invariant Derived loop invariant: ((((((!(PagingReferenceCount == 1) || 3 == s) || !(compRegistered == 0)) || !(0 == pended)) || !(3 == \old(s))) && ((s == \old(s) || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0))) && ((((((0 == __cil_tmp9 + 1073741802 && returnVal2 + 1073741823 <= 0) && 1 == setEventCalled) && s == 5) || (((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && returnVal2 == 259) && s == 5)) || !(PagingReferenceCount == 1) || (!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || (((0 == __cil_tmp9 + 1073741802 && 0 == returnVal2) && 1 == setEventCalled) && s == 5))) && ((((s == \old(s) || !(compRegistered == 0)) || !(3 == \old(s))) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 19525]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21015]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19958]: Loop Invariant Derived loop invariant: (0 == customIrp && 1 == s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 7240]: Loop Invariant Derived loop invariant: (((((((6 == s && ((0 == pended && !(0 == compRegistered)) && 1 == setEventCalled) && PagingReferenceCount == 1) || (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && 2 == s)) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (!(ntStatus == 259) && (0 == pended && 2 == s) && PagingReferenceCount == 1)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && PagingReferenceCount == 1) && s == 4)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && 0 == customIrp) && s == 4)) || ((((0 == compRegistered && lowerDriverReturn == ntStatus) && 0 == customIrp) && !(PagingReferenceCount % 4294967296 == 0)) && s == 4)) || (((0 == compRegistered && !(ntStatus == 259)) && 2 == s) && !(PagingReferenceCount % 4294967296 == 0)) - InvariantResult [Line: 21371]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7154]: 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: 5708]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6099]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20781]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) && (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) - InvariantResult [Line: 7264]: 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: 8185]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5810]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8203]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21471]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8364]: 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: 8859]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6245]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21012]: Loop Invariant Derived loop invariant: (((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || (((!(__BLAST_NONDET == 2) && 0 == pended) && 0 == compRegistered) && 1 == s)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 4336]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22195]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20370]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8914]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7238]: 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: 4925]: Loop Invariant Derived loop invariant: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) - InvariantResult [Line: 22035]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21474]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6586]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4716]: Loop Invariant Derived loop invariant: (((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s) - InvariantResult [Line: 21078]: Loop Invariant [2018-11-23 01:35:19,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,209 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,209 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,209 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,209 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,209 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,210 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,210 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,210 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset Derived loop invariant: (((((((((((((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == compRegistered) && #funAddr~FloppyPnp.base == __cil_tmp18) && s == 4) || ((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && status == lowerDriverReturn) && 0 == customIrp) && __cil_tmp14 == 1) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && 2 == s) && #funAddr~FloppyPnp.base == __cil_tmp18) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || 0 == s) || !(\old(compRegistered) == 0)) || ((((((((!(__BLAST_NONDET == 2) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && #funAddr~FloppyPnp.offset == __cil_tmp18) && !(0 == compRegistered)) && 6 == s) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(0 == \old(pended))) || 1 == s) || !(\old(customIrp) == 0) - InvariantResult [Line: 19979]: Loop Invariant Derived loop invariant: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || s == \old(s) - InvariantResult [Line: 6132]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20787]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) && (((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) - InvariantResult [Line: 7235]: 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: 6077]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22038]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22032]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4342]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19978]: Loop Invariant Derived loop invariant: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || s == \old(s) - InvariantResult [Line: 9208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7659]: 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: 5951]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7217]: 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: 9230]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5690]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21870]: Loop Invariant Derived loop invariant: (((((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled)) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) && ((customIrp == \old(customIrp) && 1 == s) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0)) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (1 == s && 0 == customIrp)) || !(\old(customIrp) == 0))) && ((((!(compRegistered == 0) || (1 == s && 0 == customIrp)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5699]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4345]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8432]: Loop Invariant Derived loop invariant: (((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (!(ntStatus == 259) && ((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1)) || (0 == InterfaceType && ((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) - InvariantResult [Line: 5535]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21070]: Loop Invariant [2018-11-23 01:35:19,212 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,215 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,215 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,215 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,215 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,216 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,216 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,216 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,216 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-11-23 01:35:19,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-11-23 01:35:19,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset Derived loop invariant: (((((((((((((((((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && 2 == s) && #funAddr~FloppyPnp.base == __cil_tmp18) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (((status == lowerDriverReturn && (((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == compRegistered) && #funAddr~FloppyPnp.base == __cil_tmp18) && s == 4) && 0 == customIrp) && __cil_tmp14 == 1)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || 0 == s) || (((status == lowerDriverReturn && (((((#funAddr~FloppyPnp.offset == __cil_tmp18 && !(__BLAST_NONDET == 2)) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount) && 0 == customIrp) && __cil_tmp14 == 1)) || !(\old(compRegistered) == 0)) || ((((((((!(__BLAST_NONDET == 2) && 0 == pended) && #funAddr~FloppyPnp.base == __cil_tmp18) && #funAddr~FloppyPnp.offset == __cil_tmp18) && !(0 == compRegistered)) && 6 == s) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || !(0 == \old(pended))) || 1 == s) || !(\old(customIrp) == 0) - InvariantResult [Line: 2886]: Loop Invariant Derived loop invariant: (((((0 == ntStatus || !(myStatus == 0)) || !(0 == s)) || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(customIrp == 0) - InvariantResult [Line: 20690]: Loop Invariant Derived loop invariant: ((((((((((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))) && ((((((((((((0 == pended && 0 == compRegistered) && __cil_tmp17 == 0) && 0 == customIrp) && headOfList == 0) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)))) && (((0 == myStatus || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || !(\old(customIrp) == 0))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s))) - InvariantResult [Line: 21374]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9119]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8185]: Loop Invariant Derived loop invariant: ((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8711]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4353]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5696]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7240]: 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: 21697]: Loop Invariant Derived loop invariant: (((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5) || !(PagingReferenceCount == 1) || (!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) && ((s == \old(s) || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((s == \old(s) || !(compRegistered == 0)) || !(3 == \old(s))) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 20691]: 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)) && (((((0 == pended && customIrp == \old(customIrp)) && !(0 == compRegistered)) && 1 == s) && 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)))) && (((((((((0 == pended && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) - InvariantResult [Line: 21694]: Loop Invariant Derived loop invariant: (((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5) || !(PagingReferenceCount == 1) || (!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) && ((s == \old(s) || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0))) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((s == \old(s) || !(compRegistered == 0)) || !(3 == \old(s))) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 5728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7443]: Loop Invariant Derived loop invariant: ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 0 == myStatus) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 4339]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21873]: Loop Invariant Derived loop invariant: (((((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled)) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) && ((customIrp == \old(customIrp) && 1 == s) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0)) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (1 == s && 0 == customIrp)) || !(\old(customIrp) == 0))) && ((((!(compRegistered == 0) || (1 == s && 0 == customIrp)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 7256]: 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: 21626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8796]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5705]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19524]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3020]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9252]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 64 procedures, 979 locations, 1 error locations. SAFE Result, 181.4s OverallTime, 58 OverallIterations, 4 TraceHistogramMax, 120.5s AutomataDifference, 0.0s DeadEndRemovalTime, 28.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 65950 SDtfs, 22405 SDslu, 281485 SDs, 0 SdLazy, 21432 SolverSat, 3877 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 100.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1757 GetRequests, 1266 SyntacticMatches, 28 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81793occurred in iteration=39, 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: 15.2s AutomataMinimizationTime, 58 MinimizatonAttempts, 6022 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 420 LocationsWithAnnotation, 229140 PreInvPairs, 229567 NumberOfFragments, 10100 HoareAnnotationTreeSize, 229140 FomulaSimplifications, 174283 FormulaSimplificationTreeSizeReduction, 10.0s HoareSimplificationTime, 420 FomulaSimplificationsInter, 117518 FormulaSimplificationTreeSizeReductionInter, 17.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 8958 NumberOfCodeBlocks, 8958 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 8894 ConstructedInterpolants, 0 QuantifiedInterpolants, 2144812 SizeOfPredicates, 34 NumberOfNonLiveVariables, 22783 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 64 InterpolantComputations, 56 PerfectInterpolantSequences, 846/885 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...