./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/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_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 606408aee7f307557affa0690bfaead4a8184376 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:04:49,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:04:49,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:04:49,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:04:49,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:04:49,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:04:49,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:04:49,952 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:04:49,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:04:49,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:04:49,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:04:49,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:04:49,954 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:04:49,954 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:04:49,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:04:49,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:04:49,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:04:49,957 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:04:49,958 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:04:49,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:04:49,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:04:49,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:04:49,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:04:49,961 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:04:49,961 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:04:49,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:04:49,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:04:49,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:04:49,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:04:49,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:04:49,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:04:49,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:04:49,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:04:49,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:04:49,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:04:49,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:04:49,965 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 01:04:49,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:04:49,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:04:49,973 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:04:49,973 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:04:49,973 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:04:49,973 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:04:49,973 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:04:49,974 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:04:49,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:04:49,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:04:49,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:04:49,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:04:49,976 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_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 606408aee7f307557affa0690bfaead4a8184376 [2018-12-09 01:04:49,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:04:50,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:04:50,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:04:50,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:04:50,005 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:04:50,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-12-09 01:04:50,041 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/data/f2e1f8ad6/9d882f96e77c44dc847967d97d25229b/FLAG2882ddb34 [2018-12-09 01:04:50,682 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:04:50,682 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-12-09 01:04:50,712 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/data/f2e1f8ad6/9d882f96e77c44dc847967d97d25229b/FLAG2882ddb34 [2018-12-09 01:04:51,084 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/data/f2e1f8ad6/9d882f96e77c44dc847967d97d25229b [2018-12-09 01:04:51,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:04:51,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:04:51,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:04:51,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:04:51,100 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:04:51,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:04:51" (1/1) ... [2018-12-09 01:04:51,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6085b642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:51, skipping insertion in model container [2018-12-09 01:04:51,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:04:51" (1/1) ... [2018-12-09 01:04:51,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:04:51,246 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:04:52,689 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:04:52,718 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:04:53,103 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:04:53,208 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:04:53,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53 WrapperNode [2018-12-09 01:04:53,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:04:53,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:04:53,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:04:53,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:04:53,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:04:53,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:04:53,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:04:53,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:04:53,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... [2018-12-09 01:04:53,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:04:53,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:04:53,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:04:53,411 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:04:53,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:04:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-12-09 01:04:53,453 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-12-09 01:04:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-12-09 01:04:53,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-12-09 01:04:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-12-09 01:04:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:04:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2018-12-09 01:04:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2018-12-09 01:04:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2018-12-09 01:04:53,454 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2018-12-09 01:04:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:04:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-12-09 01:04:53,454 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-12-09 01:04:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-12-09 01:04:53,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-12-09 01:04:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-09 01:04:53,454 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-09 01:04:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-12-09 01:04:53,454 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-12-09 01:04:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2018-12-09 01:04:53,454 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-12-09 01:04:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2018-12-09 01:04:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-12-09 01:04:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-12-09 01:04:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 01:04:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2018-12-09 01:04:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-12-09 01:04:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-12-09 01:04:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-12-09 01:04:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyReadWrite [2018-12-09 01:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyReadWrite [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2018-12-09 01:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-12-09 01:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2018-12-09 01:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-12-09 01:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-09 01:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-12-09 01:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-12-09 01:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-12-09 01:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-12-09 01:04:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-09 01:04:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2018-12-09 01:04:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-12-09 01:04:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2018-12-09 01:04:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-09 01:04:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-12-09 01:04:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-12-09 01:04:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2018-12-09 01:04:53,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:04:53,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-09 01:04:53,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-12-09 01:04:53,458 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-12-09 01:04:53,458 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:04:53,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2018-12-09 01:04:53,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-09 01:04:53,458 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2018-12-09 01:04:53,458 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2018-12-09 01:04:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-12-09 01:04:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2018-12-09 01:04:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-09 01:04:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-09 01:04:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2018-12-09 01:04:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-12-09 01:04:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2018-12-09 01:04:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-09 01:04:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-09 01:04:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPower [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPower [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyUnload [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyUnload [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2018-12-09 01:04:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2018-12-09 01:04:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-12-09 01:04:53,461 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-12-09 01:04:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 01:04:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-12-09 01:04:53,461 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-12-09 01:04:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-12-09 01:04:53,461 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-12-09 01:04:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-12-09 01:04:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-12-09 01:04:53,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-12-09 01:04:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-12-09 01:04:53,461 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-12-09 01:04:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:04:53,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:04:53,937 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:53,937 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:54,046 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:54,046 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:55,031 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:55,031 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:55,093 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:55,093 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:55,531 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:55,531 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:55,538 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:55,538 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:57,736 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:57,736 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:57,744 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:57,744 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:57,756 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:57,756 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:57,761 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:57,762 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:57,860 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:57,860 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:57,882 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:57,882 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:58,028 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:58,028 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:58,100 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:58,100 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:58,113 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:58,113 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:58,118 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:58,118 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:04:58,474 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:04:58,475 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:05:01,072 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:05:01,072 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:05:04,220 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:05:04,220 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:05:04,236 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:05:04,236 INFO L280 CfgBuilder]: Removed 49 assue(true) statements. [2018-12-09 01:05:04,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:05:04 BoogieIcfgContainer [2018-12-09 01:05:04,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:05:04,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:05:04,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:05:04,239 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:05:04,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:04:51" (1/3) ... [2018-12-09 01:05:04,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cb756f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:05:04, skipping insertion in model container [2018-12-09 01:05:04,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:53" (2/3) ... [2018-12-09 01:05:04,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cb756f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:05:04, skipping insertion in model container [2018-12-09 01:05:04,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:05:04" (3/3) ... [2018-12-09 01:05:04,241 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy2_true-unreach-call_true-termination.i.cil.c [2018-12-09 01:05:04,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:05:04,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 01:05:04,261 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 01:05:04,282 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:05:04,283 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:05:04,283 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:05:04,283 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:05:04,283 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:05:04,283 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:05:04,283 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:05:04,283 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:05:04,283 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:05:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states. [2018-12-09 01:05:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 01:05:04,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:04,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:04,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:04,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash 749980279, now seen corresponding path program 1 times [2018-12-09 01:05:04,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:04,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:04,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:04,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:04,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:04,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:04,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:05:04,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 01:05:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 01:05:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 01:05:04,571 INFO L87 Difference]: Start difference. First operand 943 states. Second operand 2 states. [2018-12-09 01:05:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:04,632 INFO L93 Difference]: Finished difference Result 1875 states and 2881 transitions. [2018-12-09 01:05:04,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 01:05:04,633 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 43 [2018-12-09 01:05:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:04,644 INFO L225 Difference]: With dead ends: 1875 [2018-12-09 01:05:04,644 INFO L226 Difference]: Without dead ends: 936 [2018-12-09 01:05:04,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 01:05:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-12-09 01:05:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2018-12-09 01:05:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-12-09 01:05:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1285 transitions. [2018-12-09 01:05:04,714 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1285 transitions. Word has length 43 [2018-12-09 01:05:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:04,714 INFO L480 AbstractCegarLoop]: Abstraction has 936 states and 1285 transitions. [2018-12-09 01:05:04,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 01:05:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1285 transitions. [2018-12-09 01:05:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 01:05:04,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:04,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:04,716 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:04,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:04,716 INFO L82 PathProgramCache]: Analyzing trace with hash 677593721, now seen corresponding path program 1 times [2018-12-09 01:05:04,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:04,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:04,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:04,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:04,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:04,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:04,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:04,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:04,854 INFO L87 Difference]: Start difference. First operand 936 states and 1285 transitions. Second operand 3 states. [2018-12-09 01:05:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:04,983 INFO L93 Difference]: Finished difference Result 972 states and 1322 transitions. [2018-12-09 01:05:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:04,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-09 01:05:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:04,989 INFO L225 Difference]: With dead ends: 972 [2018-12-09 01:05:04,989 INFO L226 Difference]: Without dead ends: 950 [2018-12-09 01:05:04,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-09 01:05:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-09 01:05:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-09 01:05:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1295 transitions. [2018-12-09 01:05:05,018 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1295 transitions. Word has length 43 [2018-12-09 01:05:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:05,018 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1295 transitions. [2018-12-09 01:05:05,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1295 transitions. [2018-12-09 01:05:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 01:05:05,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:05,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:05,020 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:05,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash -339381255, now seen corresponding path program 1 times [2018-12-09 01:05:05,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:05,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:05,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:05,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:05,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:05,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:05,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:05,134 INFO L87 Difference]: Start difference. First operand 950 states and 1295 transitions. Second operand 3 states. [2018-12-09 01:05:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:05,334 INFO L93 Difference]: Finished difference Result 2632 states and 3695 transitions. [2018-12-09 01:05:05,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:05,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-09 01:05:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:05,340 INFO L225 Difference]: With dead ends: 2632 [2018-12-09 01:05:05,341 INFO L226 Difference]: Without dead ends: 1721 [2018-12-09 01:05:05,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2018-12-09 01:05:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2018-12-09 01:05:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-12-09 01:05:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2373 transitions. [2018-12-09 01:05:05,387 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2373 transitions. Word has length 56 [2018-12-09 01:05:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:05,387 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 2373 transitions. [2018-12-09 01:05:05,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2373 transitions. [2018-12-09 01:05:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 01:05:05,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:05,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:05,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:05,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -601260739, now seen corresponding path program 1 times [2018-12-09 01:05:05,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:05,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:05,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:05,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:05,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:05,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:05,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:05:05,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:05:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:05:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:05,571 INFO L87 Difference]: Start difference. First operand 1719 states and 2373 transitions. Second operand 4 states. [2018-12-09 01:05:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:05,664 INFO L93 Difference]: Finished difference Result 3396 states and 4703 transitions. [2018-12-09 01:05:05,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:05:05,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 01:05:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:05,673 INFO L225 Difference]: With dead ends: 3396 [2018-12-09 01:05:05,673 INFO L226 Difference]: Without dead ends: 1747 [2018-12-09 01:05:05,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2018-12-09 01:05:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1729. [2018-12-09 01:05:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2018-12-09 01:05:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2383 transitions. [2018-12-09 01:05:05,720 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2383 transitions. Word has length 79 [2018-12-09 01:05:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:05,720 INFO L480 AbstractCegarLoop]: Abstraction has 1729 states and 2383 transitions. [2018-12-09 01:05:05,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:05:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2383 transitions. [2018-12-09 01:05:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 01:05:05,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:05,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:05,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:05,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash -260392060, now seen corresponding path program 1 times [2018-12-09 01:05:05,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:05,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:05,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:05,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:05,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:05,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:05,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:05:05,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:05:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:05:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:05,889 INFO L87 Difference]: Start difference. First operand 1729 states and 2383 transitions. Second operand 4 states. [2018-12-09 01:05:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:05,969 INFO L93 Difference]: Finished difference Result 3406 states and 4713 transitions. [2018-12-09 01:05:05,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:05:05,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 01:05:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:05,974 INFO L225 Difference]: With dead ends: 3406 [2018-12-09 01:05:05,974 INFO L226 Difference]: Without dead ends: 1757 [2018-12-09 01:05:05,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2018-12-09 01:05:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1739. [2018-12-09 01:05:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2018-12-09 01:05:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2393 transitions. [2018-12-09 01:05:06,013 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2393 transitions. Word has length 80 [2018-12-09 01:05:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:06,013 INFO L480 AbstractCegarLoop]: Abstraction has 1739 states and 2393 transitions. [2018-12-09 01:05:06,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:05:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2393 transitions. [2018-12-09 01:05:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:05:06,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:06,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:06,015 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:06,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 892515068, now seen corresponding path program 1 times [2018-12-09 01:05:06,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:06,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:06,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:06,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:06,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:05:06,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:05:06,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:05:06,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:06,216 INFO L87 Difference]: Start difference. First operand 1739 states and 2393 transitions. Second operand 4 states. [2018-12-09 01:05:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:06,316 INFO L93 Difference]: Finished difference Result 3419 states and 4735 transitions. [2018-12-09 01:05:06,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:05:06,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 01:05:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:06,322 INFO L225 Difference]: With dead ends: 3419 [2018-12-09 01:05:06,322 INFO L226 Difference]: Without dead ends: 1770 [2018-12-09 01:05:06,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2018-12-09 01:05:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1749. [2018-12-09 01:05:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2018-12-09 01:05:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2410 transitions. [2018-12-09 01:05:06,358 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2410 transitions. Word has length 81 [2018-12-09 01:05:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:06,359 INFO L480 AbstractCegarLoop]: Abstraction has 1749 states and 2410 transitions. [2018-12-09 01:05:06,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:05:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2410 transitions. [2018-12-09 01:05:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:05:06,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:06,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:06,360 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:06,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash -275118823, now seen corresponding path program 1 times [2018-12-09 01:05:06,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:06,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:06,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:06,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:06,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:06,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:06,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:06,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:06,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:06,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:06,451 INFO L87 Difference]: Start difference. First operand 1749 states and 2410 transitions. Second operand 3 states. [2018-12-09 01:05:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:06,605 INFO L93 Difference]: Finished difference Result 3472 states and 4865 transitions. [2018-12-09 01:05:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:06,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-09 01:05:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:06,610 INFO L225 Difference]: With dead ends: 3472 [2018-12-09 01:05:06,610 INFO L226 Difference]: Without dead ends: 1818 [2018-12-09 01:05:06,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2018-12-09 01:05:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1816. [2018-12-09 01:05:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2018-12-09 01:05:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2496 transitions. [2018-12-09 01:05:06,648 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2496 transitions. Word has length 78 [2018-12-09 01:05:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:06,648 INFO L480 AbstractCegarLoop]: Abstraction has 1816 states and 2496 transitions. [2018-12-09 01:05:06,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2496 transitions. [2018-12-09 01:05:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 01:05:06,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:06,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:06,649 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:06,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash 874664422, now seen corresponding path program 1 times [2018-12-09 01:05:06,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:06,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:06,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:06,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:06,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:06,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:06,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:06,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:06,735 INFO L87 Difference]: Start difference. First operand 1816 states and 2496 transitions. Second operand 3 states. [2018-12-09 01:05:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:06,952 INFO L93 Difference]: Finished difference Result 4409 states and 6245 transitions. [2018-12-09 01:05:06,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:06,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-09 01:05:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:06,963 INFO L225 Difference]: With dead ends: 4409 [2018-12-09 01:05:06,963 INFO L226 Difference]: Without dead ends: 2689 [2018-12-09 01:05:06,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2018-12-09 01:05:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2686. [2018-12-09 01:05:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2686 states. [2018-12-09 01:05:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 3733 transitions. [2018-12-09 01:05:07,051 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 3733 transitions. Word has length 76 [2018-12-09 01:05:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:07,052 INFO L480 AbstractCegarLoop]: Abstraction has 2686 states and 3733 transitions. [2018-12-09 01:05:07,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 3733 transitions. [2018-12-09 01:05:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 01:05:07,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:07,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:07,054 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:07,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:07,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1448810339, now seen corresponding path program 1 times [2018-12-09 01:05:07,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:07,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:07,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:07,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:07,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:07,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:05:07,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:05:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:05:07,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:07,218 INFO L87 Difference]: Start difference. First operand 2686 states and 3733 transitions. Second operand 4 states. [2018-12-09 01:05:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:07,307 INFO L93 Difference]: Finished difference Result 3353 states and 4609 transitions. [2018-12-09 01:05:07,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:05:07,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 01:05:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:07,319 INFO L225 Difference]: With dead ends: 3353 [2018-12-09 01:05:07,319 INFO L226 Difference]: Without dead ends: 2733 [2018-12-09 01:05:07,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2018-12-09 01:05:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2702. [2018-12-09 01:05:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2018-12-09 01:05:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3764 transitions. [2018-12-09 01:05:07,391 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3764 transitions. Word has length 82 [2018-12-09 01:05:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:07,391 INFO L480 AbstractCegarLoop]: Abstraction has 2702 states and 3764 transitions. [2018-12-09 01:05:07,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:05:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3764 transitions. [2018-12-09 01:05:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 01:05:07,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:07,392 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-12-09 01:05:07,393 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:07,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:07,393 INFO L82 PathProgramCache]: Analyzing trace with hash -168694535, now seen corresponding path program 1 times [2018-12-09 01:05:07,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:07,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:07,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:05:07,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:07,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:05:07,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:05:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:05:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:07,484 INFO L87 Difference]: Start difference. First operand 2702 states and 3764 transitions. Second operand 4 states. [2018-12-09 01:05:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:07,604 INFO L93 Difference]: Finished difference Result 5340 states and 7460 transitions. [2018-12-09 01:05:07,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:05:07,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-09 01:05:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:07,617 INFO L225 Difference]: With dead ends: 5340 [2018-12-09 01:05:07,617 INFO L226 Difference]: Without dead ends: 2744 [2018-12-09 01:05:07,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2018-12-09 01:05:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2713. [2018-12-09 01:05:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2018-12-09 01:05:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3778 transitions. [2018-12-09 01:05:07,675 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3778 transitions. Word has length 84 [2018-12-09 01:05:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:07,676 INFO L480 AbstractCegarLoop]: Abstraction has 2713 states and 3778 transitions. [2018-12-09 01:05:07,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:05:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3778 transitions. [2018-12-09 01:05:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 01:05:07,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:07,677 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:07,677 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:07,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:07,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1603420840, now seen corresponding path program 1 times [2018-12-09 01:05:07,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:07,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:07,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:05:07,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:07,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:07,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:07,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:07,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:07,794 INFO L87 Difference]: Start difference. First operand 2713 states and 3778 transitions. Second operand 3 states. [2018-12-09 01:05:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:07,964 INFO L93 Difference]: Finished difference Result 7864 states and 11225 transitions. [2018-12-09 01:05:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:07,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-09 01:05:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:07,981 INFO L225 Difference]: With dead ends: 7864 [2018-12-09 01:05:07,981 INFO L226 Difference]: Without dead ends: 5258 [2018-12-09 01:05:07,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-09 01:05:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-12-09 01:05:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-12-09 01:05:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 7454 transitions. [2018-12-09 01:05:08,134 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 7454 transitions. Word has length 82 [2018-12-09 01:05:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:08,134 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 7454 transitions. [2018-12-09 01:05:08,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 7454 transitions. [2018-12-09 01:05:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 01:05:08,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:08,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:08,136 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:08,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2058151995, now seen corresponding path program 1 times [2018-12-09 01:05:08,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:08,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:08,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:08,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:08,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:08,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:08,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:08,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:08,297 INFO L87 Difference]: Start difference. First operand 5256 states and 7454 transitions. Second operand 3 states. [2018-12-09 01:05:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:08,535 INFO L93 Difference]: Finished difference Result 15342 states and 22892 transitions. [2018-12-09 01:05:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:08,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-09 01:05:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:08,571 INFO L225 Difference]: With dead ends: 15342 [2018-12-09 01:05:08,571 INFO L226 Difference]: Without dead ends: 10193 [2018-12-09 01:05:08,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2018-12-09 01:05:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 10182. [2018-12-09 01:05:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2018-12-09 01:05:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 14993 transitions. [2018-12-09 01:05:08,828 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 14993 transitions. Word has length 95 [2018-12-09 01:05:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:08,828 INFO L480 AbstractCegarLoop]: Abstraction has 10182 states and 14993 transitions. [2018-12-09 01:05:08,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 14993 transitions. [2018-12-09 01:05:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:05:08,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:08,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:08,829 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:08,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash -91683281, now seen corresponding path program 1 times [2018-12-09 01:05:08,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:08,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:08,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:08,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:08,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:08,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:08,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:05:08,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:05:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:05:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:08,919 INFO L87 Difference]: Start difference. First operand 10182 states and 14993 transitions. Second operand 4 states. [2018-12-09 01:05:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:09,079 INFO L93 Difference]: Finished difference Result 10262 states and 15084 transitions. [2018-12-09 01:05:09,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:05:09,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 01:05:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:09,104 INFO L225 Difference]: With dead ends: 10262 [2018-12-09 01:05:09,104 INFO L226 Difference]: Without dead ends: 10221 [2018-12-09 01:05:09,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10221 states. [2018-12-09 01:05:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10221 to 10178. [2018-12-09 01:05:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10178 states. [2018-12-09 01:05:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10178 states to 10178 states and 14987 transitions. [2018-12-09 01:05:09,321 INFO L78 Accepts]: Start accepts. Automaton has 10178 states and 14987 transitions. Word has length 81 [2018-12-09 01:05:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:09,321 INFO L480 AbstractCegarLoop]: Abstraction has 10178 states and 14987 transitions. [2018-12-09 01:05:09,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:05:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 10178 states and 14987 transitions. [2018-12-09 01:05:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 01:05:09,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:09,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:09,322 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:09,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 489150260, now seen corresponding path program 1 times [2018-12-09 01:05:09,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:09,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:09,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:09,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:09,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:05:09,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:05:09,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:05:09,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:09,404 INFO L87 Difference]: Start difference. First operand 10178 states and 14987 transitions. Second operand 4 states. [2018-12-09 01:05:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:09,567 INFO L93 Difference]: Finished difference Result 10276 states and 15120 transitions. [2018-12-09 01:05:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:05:09,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 01:05:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:09,589 INFO L225 Difference]: With dead ends: 10276 [2018-12-09 01:05:09,589 INFO L226 Difference]: Without dead ends: 10236 [2018-12-09 01:05:09,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:05:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10236 states. [2018-12-09 01:05:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10236 to 10187. [2018-12-09 01:05:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10187 states. [2018-12-09 01:05:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10187 states to 10187 states and 15002 transitions. [2018-12-09 01:05:09,826 INFO L78 Accepts]: Start accepts. Automaton has 10187 states and 15002 transitions. Word has length 80 [2018-12-09 01:05:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:09,826 INFO L480 AbstractCegarLoop]: Abstraction has 10187 states and 15002 transitions. [2018-12-09 01:05:09,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:05:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 10187 states and 15002 transitions. [2018-12-09 01:05:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 01:05:09,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:09,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-12-09 01:05:09,827 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:09,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1882022250, now seen corresponding path program 1 times [2018-12-09 01:05:09,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:09,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:09,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:09,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:09,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:05:09,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:05:09,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:05:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:05:09,952 INFO L87 Difference]: Start difference. First operand 10187 states and 15002 transitions. Second operand 8 states. [2018-12-09 01:05:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:10,116 INFO L93 Difference]: Finished difference Result 10231 states and 15071 transitions. [2018-12-09 01:05:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:05:10,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-09 01:05:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:10,139 INFO L225 Difference]: With dead ends: 10231 [2018-12-09 01:05:10,139 INFO L226 Difference]: Without dead ends: 10198 [2018-12-09 01:05:10,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:05:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10198 states. [2018-12-09 01:05:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10198 to 10183. [2018-12-09 01:05:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10183 states. [2018-12-09 01:05:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 15003 transitions. [2018-12-09 01:05:10,332 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 15003 transitions. Word has length 79 [2018-12-09 01:05:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:10,333 INFO L480 AbstractCegarLoop]: Abstraction has 10183 states and 15003 transitions. [2018-12-09 01:05:10,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:05:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 15003 transitions. [2018-12-09 01:05:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:05:10,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:10,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:10,334 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:10,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1499973711, now seen corresponding path program 1 times [2018-12-09 01:05:10,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:10,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:10,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:10,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:10,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:10,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:10,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:05:10,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:05:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:05:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:05:10,447 INFO L87 Difference]: Start difference. First operand 10183 states and 15003 transitions. Second operand 8 states. [2018-12-09 01:05:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:10,600 INFO L93 Difference]: Finished difference Result 10218 states and 15056 transitions. [2018-12-09 01:05:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:05:10,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-09 01:05:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:10,623 INFO L225 Difference]: With dead ends: 10218 [2018-12-09 01:05:10,624 INFO L226 Difference]: Without dead ends: 10185 [2018-12-09 01:05:10,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:05:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10185 states. [2018-12-09 01:05:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10185 to 10170. [2018-12-09 01:05:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10170 states. [2018-12-09 01:05:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 14988 transitions. [2018-12-09 01:05:10,824 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 14988 transitions. Word has length 78 [2018-12-09 01:05:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:10,825 INFO L480 AbstractCegarLoop]: Abstraction has 10170 states and 14988 transitions. [2018-12-09 01:05:10,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:05:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 14988 transitions. [2018-12-09 01:05:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 01:05:10,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:10,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:10,826 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:10,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash 278370407, now seen corresponding path program 1 times [2018-12-09 01:05:10,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:10,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:10,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:10,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:10,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:05:10,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:05:10,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:05:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:05:10,955 INFO L87 Difference]: Start difference. First operand 10170 states and 14988 transitions. Second operand 8 states. [2018-12-09 01:05:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:11,130 INFO L93 Difference]: Finished difference Result 10239 states and 15091 transitions. [2018-12-09 01:05:11,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:05:11,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-12-09 01:05:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:11,151 INFO L225 Difference]: With dead ends: 10239 [2018-12-09 01:05:11,151 INFO L226 Difference]: Without dead ends: 10218 [2018-12-09 01:05:11,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:05:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10218 states. [2018-12-09 01:05:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10218 to 10194. [2018-12-09 01:05:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10194 states. [2018-12-09 01:05:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10194 states to 10194 states and 15020 transitions. [2018-12-09 01:05:11,385 INFO L78 Accepts]: Start accepts. Automaton has 10194 states and 15020 transitions. Word has length 90 [2018-12-09 01:05:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:11,385 INFO L480 AbstractCegarLoop]: Abstraction has 10194 states and 15020 transitions. [2018-12-09 01:05:11,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:05:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 10194 states and 15020 transitions. [2018-12-09 01:05:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 01:05:11,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:11,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:11,387 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:11,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 816708719, now seen corresponding path program 1 times [2018-12-09 01:05:11,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:11,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:11,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:11,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:11,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:11,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:11,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:05:11,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:05:11,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:05:11,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:05:11,517 INFO L87 Difference]: Start difference. First operand 10194 states and 15020 transitions. Second operand 8 states. [2018-12-09 01:05:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:11,687 INFO L93 Difference]: Finished difference Result 10263 states and 15123 transitions. [2018-12-09 01:05:11,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:05:11,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-09 01:05:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:11,707 INFO L225 Difference]: With dead ends: 10263 [2018-12-09 01:05:11,707 INFO L226 Difference]: Without dead ends: 10242 [2018-12-09 01:05:11,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:05:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states. [2018-12-09 01:05:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10215. [2018-12-09 01:05:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10215 states. [2018-12-09 01:05:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10215 states to 10215 states and 15047 transitions. [2018-12-09 01:05:11,904 INFO L78 Accepts]: Start accepts. Automaton has 10215 states and 15047 transitions. Word has length 92 [2018-12-09 01:05:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:11,904 INFO L480 AbstractCegarLoop]: Abstraction has 10215 states and 15047 transitions. [2018-12-09 01:05:11,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:05:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 10215 states and 15047 transitions. [2018-12-09 01:05:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 01:05:11,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:11,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:11,905 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:11,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1153676747, now seen corresponding path program 1 times [2018-12-09 01:05:11,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:11,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:11,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:11,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-12-09 01:05:11,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:11,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:11,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:11,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:11,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:11,984 INFO L87 Difference]: Start difference. First operand 10215 states and 15047 transitions. Second operand 3 states. [2018-12-09 01:05:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:12,386 INFO L93 Difference]: Finished difference Result 23800 states and 36859 transitions. [2018-12-09 01:05:12,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:12,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-09 01:05:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:12,415 INFO L225 Difference]: With dead ends: 23800 [2018-12-09 01:05:12,415 INFO L226 Difference]: Without dead ends: 13661 [2018-12-09 01:05:12,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13661 states. [2018-12-09 01:05:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13661 to 13641. [2018-12-09 01:05:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13641 states. [2018-12-09 01:05:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13641 states to 13641 states and 20416 transitions. [2018-12-09 01:05:12,701 INFO L78 Accepts]: Start accepts. Automaton has 13641 states and 20416 transitions. Word has length 91 [2018-12-09 01:05:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:12,701 INFO L480 AbstractCegarLoop]: Abstraction has 13641 states and 20416 transitions. [2018-12-09 01:05:12,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 13641 states and 20416 transitions. [2018-12-09 01:05:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 01:05:12,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:12,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:12,703 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:12,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:12,703 INFO L82 PathProgramCache]: Analyzing trace with hash -887643117, now seen corresponding path program 1 times [2018-12-09 01:05:12,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:12,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:12,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:12,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:12,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:05:12,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:05:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:05:12,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:05:12,900 INFO L87 Difference]: Start difference. First operand 13641 states and 20416 transitions. Second operand 12 states. [2018-12-09 01:05:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:13,361 INFO L93 Difference]: Finished difference Result 13739 states and 20533 transitions. [2018-12-09 01:05:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:05:13,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-12-09 01:05:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:13,386 INFO L225 Difference]: With dead ends: 13739 [2018-12-09 01:05:13,386 INFO L226 Difference]: Without dead ends: 13720 [2018-12-09 01:05:13,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:05:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13720 states. [2018-12-09 01:05:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13720 to 13674. [2018-12-09 01:05:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13674 states. [2018-12-09 01:05:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13674 states to 13674 states and 20452 transitions. [2018-12-09 01:05:13,635 INFO L78 Accepts]: Start accepts. Automaton has 13674 states and 20452 transitions. Word has length 91 [2018-12-09 01:05:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:13,635 INFO L480 AbstractCegarLoop]: Abstraction has 13674 states and 20452 transitions. [2018-12-09 01:05:13,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:05:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 13674 states and 20452 transitions. [2018-12-09 01:05:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 01:05:13,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:13,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:13,636 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:13,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:13,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1117623323, now seen corresponding path program 1 times [2018-12-09 01:05:13,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:13,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:13,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:05:13,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:05:13,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:05:13,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:05:13,782 INFO L87 Difference]: Start difference. First operand 13674 states and 20452 transitions. Second operand 12 states. [2018-12-09 01:05:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:14,284 INFO L93 Difference]: Finished difference Result 13797 states and 20689 transitions. [2018-12-09 01:05:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:05:14,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-12-09 01:05:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:14,309 INFO L225 Difference]: With dead ends: 13797 [2018-12-09 01:05:14,309 INFO L226 Difference]: Without dead ends: 13778 [2018-12-09 01:05:14,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:05:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2018-12-09 01:05:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 13740. [2018-12-09 01:05:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-09 01:05:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 20600 transitions. [2018-12-09 01:05:14,556 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 20600 transitions. Word has length 99 [2018-12-09 01:05:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:14,556 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 20600 transitions. [2018-12-09 01:05:14,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:05:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 20600 transitions. [2018-12-09 01:05:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 01:05:14,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:14,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:14,558 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:14,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:14,558 INFO L82 PathProgramCache]: Analyzing trace with hash 509192028, now seen corresponding path program 1 times [2018-12-09 01:05:14,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:14,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:14,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:14,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:14,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:14,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:14,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:05:14,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:05:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:05:14,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:05:14,651 INFO L87 Difference]: Start difference. First operand 13740 states and 20600 transitions. Second operand 8 states. [2018-12-09 01:05:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:14,821 INFO L93 Difference]: Finished difference Result 13832 states and 20713 transitions. [2018-12-09 01:05:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:05:14,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-09 01:05:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:14,846 INFO L225 Difference]: With dead ends: 13832 [2018-12-09 01:05:14,847 INFO L226 Difference]: Without dead ends: 13806 [2018-12-09 01:05:14,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:05:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13806 states. [2018-12-09 01:05:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13806 to 13756. [2018-12-09 01:05:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-12-09 01:05:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 20606 transitions. [2018-12-09 01:05:15,168 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 20606 transitions. Word has length 100 [2018-12-09 01:05:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:15,168 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 20606 transitions. [2018-12-09 01:05:15,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:05:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 20606 transitions. [2018-12-09 01:05:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 01:05:15,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:15,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:15,170 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:15,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:15,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1932092970, now seen corresponding path program 1 times [2018-12-09 01:05:15,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:15,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:15,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:15,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:15,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:15,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:15,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:05:15,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:05:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:05:15,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:05:15,292 INFO L87 Difference]: Start difference. First operand 13756 states and 20606 transitions. Second operand 9 states. [2018-12-09 01:05:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:15,684 INFO L93 Difference]: Finished difference Result 27609 states and 42750 transitions. [2018-12-09 01:05:15,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:05:15,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2018-12-09 01:05:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:15,717 INFO L225 Difference]: With dead ends: 27609 [2018-12-09 01:05:15,717 INFO L226 Difference]: Without dead ends: 13892 [2018-12-09 01:05:15,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:05:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13892 states. [2018-12-09 01:05:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13892 to 13794. [2018-12-09 01:05:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13794 states. [2018-12-09 01:05:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13794 states to 13794 states and 20648 transitions. [2018-12-09 01:05:16,018 INFO L78 Accepts]: Start accepts. Automaton has 13794 states and 20648 transitions. Word has length 100 [2018-12-09 01:05:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:16,018 INFO L480 AbstractCegarLoop]: Abstraction has 13794 states and 20648 transitions. [2018-12-09 01:05:16,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:05:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 13794 states and 20648 transitions. [2018-12-09 01:05:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 01:05:16,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:16,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:16,020 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:16,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:16,020 INFO L82 PathProgramCache]: Analyzing trace with hash 42163119, now seen corresponding path program 1 times [2018-12-09 01:05:16,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:16,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:16,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:16,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:16,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:16,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:16,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:05:16,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:05:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:05:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:05:16,119 INFO L87 Difference]: Start difference. First operand 13794 states and 20648 transitions. Second operand 6 states. [2018-12-09 01:05:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:17,290 INFO L93 Difference]: Finished difference Result 27522 states and 42185 transitions. [2018-12-09 01:05:17,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:05:17,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-12-09 01:05:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:17,324 INFO L225 Difference]: With dead ends: 27522 [2018-12-09 01:05:17,324 INFO L226 Difference]: Without dead ends: 13796 [2018-12-09 01:05:17,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:05:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13796 states. [2018-12-09 01:05:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13796 to 13756. [2018-12-09 01:05:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-12-09 01:05:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 19966 transitions. [2018-12-09 01:05:17,674 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 19966 transitions. Word has length 108 [2018-12-09 01:05:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:17,675 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 19966 transitions. [2018-12-09 01:05:17,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:05:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 19966 transitions. [2018-12-09 01:05:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 01:05:17,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:17,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:17,676 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:17,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash 631278707, now seen corresponding path program 1 times [2018-12-09 01:05:17,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:17,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:17,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:17,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:17,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:17,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:17,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:05:17,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:05:17,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:05:17,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:05:17,841 INFO L87 Difference]: Start difference. First operand 13756 states and 19966 transitions. Second operand 12 states. [2018-12-09 01:05:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:18,347 INFO L93 Difference]: Finished difference Result 13858 states and 20107 transitions. [2018-12-09 01:05:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:05:18,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-12-09 01:05:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:18,371 INFO L225 Difference]: With dead ends: 13858 [2018-12-09 01:05:18,371 INFO L226 Difference]: Without dead ends: 13839 [2018-12-09 01:05:18,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:05:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2018-12-09 01:05:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13791. [2018-12-09 01:05:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13791 states. [2018-12-09 01:05:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13791 states to 13791 states and 20018 transitions. [2018-12-09 01:05:18,626 INFO L78 Accepts]: Start accepts. Automaton has 13791 states and 20018 transitions. Word has length 103 [2018-12-09 01:05:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:18,626 INFO L480 AbstractCegarLoop]: Abstraction has 13791 states and 20018 transitions. [2018-12-09 01:05:18,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:05:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 13791 states and 20018 transitions. [2018-12-09 01:05:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:05:18,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:18,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:18,628 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:18,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:18,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1810762344, now seen corresponding path program 1 times [2018-12-09 01:05:18,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:18,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:18,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:18,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:18,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:05:18,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:05:18,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:05:18,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:05:18,784 INFO L87 Difference]: Start difference. First operand 13791 states and 20018 transitions. Second operand 12 states. [2018-12-09 01:05:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:19,305 INFO L93 Difference]: Finished difference Result 13889 states and 20105 transitions. [2018-12-09 01:05:19,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:05:19,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-12-09 01:05:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:19,329 INFO L225 Difference]: With dead ends: 13889 [2018-12-09 01:05:19,329 INFO L226 Difference]: Without dead ends: 13870 [2018-12-09 01:05:19,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:05:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2018-12-09 01:05:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13756. [2018-12-09 01:05:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-12-09 01:05:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 19928 transitions. [2018-12-09 01:05:19,577 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 19928 transitions. Word has length 111 [2018-12-09 01:05:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:19,577 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 19928 transitions. [2018-12-09 01:05:19,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:05:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 19928 transitions. [2018-12-09 01:05:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 01:05:19,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:19,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:19,579 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:19,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1852412588, now seen corresponding path program 1 times [2018-12-09 01:05:19,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:19,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:19,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:19,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:19,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:19,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:19,668 INFO L87 Difference]: Start difference. First operand 13756 states and 19928 transitions. Second operand 3 states. [2018-12-09 01:05:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:19,983 INFO L93 Difference]: Finished difference Result 20754 states and 30659 transitions. [2018-12-09 01:05:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:19,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-09 01:05:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:20,014 INFO L225 Difference]: With dead ends: 20754 [2018-12-09 01:05:20,014 INFO L226 Difference]: Without dead ends: 13788 [2018-12-09 01:05:20,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13788 states. [2018-12-09 01:05:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13788 to 13788. [2018-12-09 01:05:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13788 states. [2018-12-09 01:05:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13788 states to 13788 states and 19956 transitions. [2018-12-09 01:05:20,334 INFO L78 Accepts]: Start accepts. Automaton has 13788 states and 19956 transitions. Word has length 120 [2018-12-09 01:05:20,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:20,334 INFO L480 AbstractCegarLoop]: Abstraction has 13788 states and 19956 transitions. [2018-12-09 01:05:20,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 13788 states and 19956 transitions. [2018-12-09 01:05:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 01:05:20,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:20,336 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:20,336 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:20,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash -436029665, now seen corresponding path program 1 times [2018-12-09 01:05:20,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:20,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:20,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:20,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 01:05:20,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:05:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:05:20,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:05:20,491 INFO L87 Difference]: Start difference. First operand 13788 states and 19956 transitions. Second operand 13 states. [2018-12-09 01:05:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:21,089 INFO L93 Difference]: Finished difference Result 13971 states and 20213 transitions. [2018-12-09 01:05:21,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:05:21,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-09 01:05:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:21,113 INFO L225 Difference]: With dead ends: 13971 [2018-12-09 01:05:21,113 INFO L226 Difference]: Without dead ends: 13952 [2018-12-09 01:05:21,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:05:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13952 states. [2018-12-09 01:05:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13952 to 13880. [2018-12-09 01:05:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13880 states. [2018-12-09 01:05:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13880 states to 13880 states and 20096 transitions. [2018-12-09 01:05:21,364 INFO L78 Accepts]: Start accepts. Automaton has 13880 states and 20096 transitions. Word has length 115 [2018-12-09 01:05:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:21,364 INFO L480 AbstractCegarLoop]: Abstraction has 13880 states and 20096 transitions. [2018-12-09 01:05:21,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:05:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 13880 states and 20096 transitions. [2018-12-09 01:05:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 01:05:21,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:21,366 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:21,366 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:21,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1356313327, now seen corresponding path program 1 times [2018-12-09 01:05:21,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:21,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:21,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:21,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:21,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:21,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:21,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 01:05:21,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:05:21,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:05:21,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:05:21,514 INFO L87 Difference]: Start difference. First operand 13880 states and 20096 transitions. Second operand 13 states. [2018-12-09 01:05:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:22,121 INFO L93 Difference]: Finished difference Result 14063 states and 20353 transitions. [2018-12-09 01:05:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:05:22,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-09 01:05:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:22,147 INFO L225 Difference]: With dead ends: 14063 [2018-12-09 01:05:22,147 INFO L226 Difference]: Without dead ends: 14044 [2018-12-09 01:05:22,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:05:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14044 states. [2018-12-09 01:05:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14044 to 13888. [2018-12-09 01:05:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13888 states. [2018-12-09 01:05:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13888 states to 13888 states and 20104 transitions. [2018-12-09 01:05:22,400 INFO L78 Accepts]: Start accepts. Automaton has 13888 states and 20104 transitions. Word has length 115 [2018-12-09 01:05:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:22,400 INFO L480 AbstractCegarLoop]: Abstraction has 13888 states and 20104 transitions. [2018-12-09 01:05:22,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:05:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 13888 states and 20104 transitions. [2018-12-09 01:05:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 01:05:22,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:22,401 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:22,402 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:22,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:22,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1738777831, now seen corresponding path program 1 times [2018-12-09 01:05:22,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:22,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:22,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:22,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:22,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:22,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:22,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 01:05:22,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:05:22,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:05:22,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:05:22,555 INFO L87 Difference]: Start difference. First operand 13888 states and 20104 transitions. Second operand 13 states. [2018-12-09 01:05:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:23,202 INFO L93 Difference]: Finished difference Result 14071 states and 20361 transitions. [2018-12-09 01:05:23,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:05:23,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-12-09 01:05:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:23,226 INFO L225 Difference]: With dead ends: 14071 [2018-12-09 01:05:23,227 INFO L226 Difference]: Without dead ends: 14052 [2018-12-09 01:05:23,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:05:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14052 states. [2018-12-09 01:05:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14052 to 13896. [2018-12-09 01:05:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13896 states. [2018-12-09 01:05:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13896 states to 13896 states and 20112 transitions. [2018-12-09 01:05:23,520 INFO L78 Accepts]: Start accepts. Automaton has 13896 states and 20112 transitions. Word has length 116 [2018-12-09 01:05:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:23,520 INFO L480 AbstractCegarLoop]: Abstraction has 13896 states and 20112 transitions. [2018-12-09 01:05:23,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:05:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13896 states and 20112 transitions. [2018-12-09 01:05:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 01:05:23,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:23,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:23,521 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:23,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:23,522 INFO L82 PathProgramCache]: Analyzing trace with hash -363944037, now seen corresponding path program 1 times [2018-12-09 01:05:23,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:23,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:23,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:23,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:23,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:05:23,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:05:23,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:05:23,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:05:23,609 INFO L87 Difference]: Start difference. First operand 13896 states and 20112 transitions. Second operand 6 states. [2018-12-09 01:05:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:23,923 INFO L93 Difference]: Finished difference Result 27949 states and 41794 transitions. [2018-12-09 01:05:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:05:23,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-12-09 01:05:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:23,954 INFO L225 Difference]: With dead ends: 27949 [2018-12-09 01:05:23,954 INFO L226 Difference]: Without dead ends: 14120 [2018-12-09 01:05:23,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:05:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14120 states. [2018-12-09 01:05:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14120 to 14072. [2018-12-09 01:05:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2018-12-09 01:05:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 20598 transitions. [2018-12-09 01:05:24,248 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 20598 transitions. Word has length 124 [2018-12-09 01:05:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:24,249 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 20598 transitions. [2018-12-09 01:05:24,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:05:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 20598 transitions. [2018-12-09 01:05:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 01:05:24,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:24,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:24,250 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:24,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:24,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1020549295, now seen corresponding path program 1 times [2018-12-09 01:05:24,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:24,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:24,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:24,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:24,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:05:24,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:05:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:05:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:05:24,337 INFO L87 Difference]: Start difference. First operand 14072 states and 20598 transitions. Second operand 6 states. [2018-12-09 01:05:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:24,690 INFO L93 Difference]: Finished difference Result 28337 states and 42837 transitions. [2018-12-09 01:05:24,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:05:24,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-09 01:05:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:24,724 INFO L225 Difference]: With dead ends: 28337 [2018-12-09 01:05:24,724 INFO L226 Difference]: Without dead ends: 14332 [2018-12-09 01:05:24,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:05:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14332 states. [2018-12-09 01:05:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14332 to 14214. [2018-12-09 01:05:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2018-12-09 01:05:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 20907 transitions. [2018-12-09 01:05:25,036 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 20907 transitions. Word has length 125 [2018-12-09 01:05:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:25,037 INFO L480 AbstractCegarLoop]: Abstraction has 14214 states and 20907 transitions. [2018-12-09 01:05:25,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:05:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 20907 transitions. [2018-12-09 01:05:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 01:05:25,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:25,038 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:25,038 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:25,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1228202997, now seen corresponding path program 1 times [2018-12-09 01:05:25,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:25,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:25,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 01:05:25,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:05:25,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:05:25,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:25,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:05:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:25,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:05:25,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-12-09 01:05:25,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:05:25,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:05:25,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:05:25,514 INFO L87 Difference]: Start difference. First operand 14214 states and 20907 transitions. Second operand 8 states. [2018-12-09 01:05:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:26,151 INFO L93 Difference]: Finished difference Result 28649 states and 43747 transitions. [2018-12-09 01:05:26,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:05:26,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2018-12-09 01:05:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:26,220 INFO L225 Difference]: With dead ends: 28649 [2018-12-09 01:05:26,221 INFO L226 Difference]: Without dead ends: 14502 [2018-12-09 01:05:26,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:05:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14502 states. [2018-12-09 01:05:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14502 to 14358. [2018-12-09 01:05:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14358 states. [2018-12-09 01:05:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14358 states to 14358 states and 21123 transitions. [2018-12-09 01:05:26,807 INFO L78 Accepts]: Start accepts. Automaton has 14358 states and 21123 transitions. Word has length 122 [2018-12-09 01:05:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:26,808 INFO L480 AbstractCegarLoop]: Abstraction has 14358 states and 21123 transitions. [2018-12-09 01:05:26,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:05:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 14358 states and 21123 transitions. [2018-12-09 01:05:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 01:05:26,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:26,811 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] [2018-12-09 01:05:26,811 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:26,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:26,812 INFO L82 PathProgramCache]: Analyzing trace with hash -949167704, now seen corresponding path program 1 times [2018-12-09 01:05:26,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:26,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:26,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:26,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:26,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:26,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:26,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:26,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:26,903 INFO L87 Difference]: Start difference. First operand 14358 states and 21123 transitions. Second operand 3 states. [2018-12-09 01:05:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:27,545 INFO L93 Difference]: Finished difference Result 32233 states and 49905 transitions. [2018-12-09 01:05:27,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:27,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-12-09 01:05:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:27,603 INFO L225 Difference]: With dead ends: 32233 [2018-12-09 01:05:27,604 INFO L226 Difference]: Without dead ends: 17942 [2018-12-09 01:05:27,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17942 states. [2018-12-09 01:05:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17942 to 17904. [2018-12-09 01:05:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17904 states. [2018-12-09 01:05:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17904 states to 17904 states and 27280 transitions. [2018-12-09 01:05:28,101 INFO L78 Accepts]: Start accepts. Automaton has 17904 states and 27280 transitions. Word has length 126 [2018-12-09 01:05:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:28,102 INFO L480 AbstractCegarLoop]: Abstraction has 17904 states and 27280 transitions. [2018-12-09 01:05:28,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 17904 states and 27280 transitions. [2018-12-09 01:05:28,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 01:05:28,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:28,104 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:28,104 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:28,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2101883920, now seen corresponding path program 1 times [2018-12-09 01:05:28,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:28,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:28,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:28,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:28,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:05:28,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:28,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:05:28,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:05:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:05:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:05:28,283 INFO L87 Difference]: Start difference. First operand 17904 states and 27280 transitions. Second operand 12 states. [2018-12-09 01:05:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:28,724 INFO L93 Difference]: Finished difference Result 18068 states and 27492 transitions. [2018-12-09 01:05:28,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:05:28,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-12-09 01:05:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:28,769 INFO L225 Difference]: With dead ends: 18068 [2018-12-09 01:05:28,769 INFO L226 Difference]: Without dead ends: 18041 [2018-12-09 01:05:28,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:05:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18041 states. [2018-12-09 01:05:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18041 to 17990. [2018-12-09 01:05:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17990 states. [2018-12-09 01:05:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17990 states to 17990 states and 27366 transitions. [2018-12-09 01:05:29,183 INFO L78 Accepts]: Start accepts. Automaton has 17990 states and 27366 transitions. Word has length 130 [2018-12-09 01:05:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:29,183 INFO L480 AbstractCegarLoop]: Abstraction has 17990 states and 27366 transitions. [2018-12-09 01:05:29,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:05:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 17990 states and 27366 transitions. [2018-12-09 01:05:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 01:05:29,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:29,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:29,185 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:29,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:29,186 INFO L82 PathProgramCache]: Analyzing trace with hash 165704108, now seen corresponding path program 1 times [2018-12-09 01:05:29,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:29,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:29,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:29,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:29,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:29,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:29,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:29,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:29,279 INFO L87 Difference]: Start difference. First operand 17990 states and 27366 transitions. Second operand 3 states. [2018-12-09 01:05:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:29,743 INFO L93 Difference]: Finished difference Result 36092 states and 57214 transitions. [2018-12-09 01:05:29,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:29,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-12-09 01:05:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:29,794 INFO L225 Difference]: With dead ends: 36092 [2018-12-09 01:05:29,795 INFO L226 Difference]: Without dead ends: 18162 [2018-12-09 01:05:29,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2018-12-09 01:05:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 18014. [2018-12-09 01:05:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18014 states. [2018-12-09 01:05:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18014 states to 18014 states and 27406 transitions. [2018-12-09 01:05:30,234 INFO L78 Accepts]: Start accepts. Automaton has 18014 states and 27406 transitions. Word has length 132 [2018-12-09 01:05:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:30,234 INFO L480 AbstractCegarLoop]: Abstraction has 18014 states and 27406 transitions. [2018-12-09 01:05:30,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 18014 states and 27406 transitions. [2018-12-09 01:05:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 01:05:30,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:30,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:30,236 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:30,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1954079212, now seen corresponding path program 1 times [2018-12-09 01:05:30,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:30,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:30,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:30,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:30,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:30,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:30,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:05:30,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:05:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:05:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:30,333 INFO L87 Difference]: Start difference. First operand 18014 states and 27406 transitions. Second operand 3 states. [2018-12-09 01:05:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:30,758 INFO L93 Difference]: Finished difference Result 29806 states and 46483 transitions. [2018-12-09 01:05:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:05:30,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-12-09 01:05:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:30,818 INFO L225 Difference]: With dead ends: 29806 [2018-12-09 01:05:30,818 INFO L226 Difference]: Without dead ends: 20732 [2018-12-09 01:05:30,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:05:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20732 states. [2018-12-09 01:05:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20732 to 20523. [2018-12-09 01:05:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20523 states. [2018-12-09 01:05:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20523 states to 20523 states and 31355 transitions. [2018-12-09 01:05:31,322 INFO L78 Accepts]: Start accepts. Automaton has 20523 states and 31355 transitions. Word has length 132 [2018-12-09 01:05:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:31,322 INFO L480 AbstractCegarLoop]: Abstraction has 20523 states and 31355 transitions. [2018-12-09 01:05:31,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:05:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 20523 states and 31355 transitions. [2018-12-09 01:05:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 01:05:31,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:31,324 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:31,324 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:31,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash 446279291, now seen corresponding path program 1 times [2018-12-09 01:05:31,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:31,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:31,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 01:05:31,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:05:31,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:05:31,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:05:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:05:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:05:31,423 INFO L87 Difference]: Start difference. First operand 20523 states and 31355 transitions. Second operand 7 states. [2018-12-09 01:05:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:05:31,886 INFO L93 Difference]: Finished difference Result 41009 states and 62670 transitions. [2018-12-09 01:05:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:05:31,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-12-09 01:05:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:05:31,944 INFO L225 Difference]: With dead ends: 41009 [2018-12-09 01:05:31,944 INFO L226 Difference]: Without dead ends: 20523 [2018-12-09 01:05:31,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:05:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20523 states. [2018-12-09 01:05:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20523 to 20523. [2018-12-09 01:05:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20523 states. [2018-12-09 01:05:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20523 states to 20523 states and 31354 transitions. [2018-12-09 01:05:32,575 INFO L78 Accepts]: Start accepts. Automaton has 20523 states and 31354 transitions. Word has length 132 [2018-12-09 01:05:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:05:32,575 INFO L480 AbstractCegarLoop]: Abstraction has 20523 states and 31354 transitions. [2018-12-09 01:05:32,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:05:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 20523 states and 31354 transitions. [2018-12-09 01:05:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:05:32,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:05:32,576 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:05:32,577 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:05:32,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:05:32,577 INFO L82 PathProgramCache]: Analyzing trace with hash 582236560, now seen corresponding path program 1 times [2018-12-09 01:05:32,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:05:32,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:05:32,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:32,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:32,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:05:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:05:32,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:05:32,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:05:32,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:05:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:33,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:05:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:05:33,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:05:33,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-09 01:05:33,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:05:33,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:05:33,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:05:33,320 INFO L87 Difference]: Start difference. First operand 20523 states and 31354 transitions. Second operand 10 states. [2018-12-09 01:06:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:17,406 INFO L93 Difference]: Finished difference Result 104633 states and 192248 transitions. [2018-12-09 01:06:17,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:06:17,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-12-09 01:06:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:17,737 INFO L225 Difference]: With dead ends: 104633 [2018-12-09 01:06:17,737 INFO L226 Difference]: Without dead ends: 84170 [2018-12-09 01:06:17,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:06:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84170 states. [2018-12-09 01:06:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84170 to 82234. [2018-12-09 01:06:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82234 states. [2018-12-09 01:06:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82234 states to 82234 states and 151120 transitions. [2018-12-09 01:06:20,858 INFO L78 Accepts]: Start accepts. Automaton has 82234 states and 151120 transitions. Word has length 146 [2018-12-09 01:06:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:20,858 INFO L480 AbstractCegarLoop]: Abstraction has 82234 states and 151120 transitions. [2018-12-09 01:06:20,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:06:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 82234 states and 151120 transitions. [2018-12-09 01:06:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:06:20,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:20,860 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:20,860 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:20,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash -650794510, now seen corresponding path program 1 times [2018-12-09 01:06:20,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:20,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:20,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 01:06:21,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:06:21,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:06:21,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:21,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:06:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:06:21,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:06:21,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 10 [2018-12-09 01:06:21,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:06:21,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:06:21,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:06:21,922 INFO L87 Difference]: Start difference. First operand 82234 states and 151120 transitions. Second operand 10 states. [2018-12-09 01:06:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:49,286 INFO L93 Difference]: Finished difference Result 84432 states and 154109 transitions. [2018-12-09 01:06:49,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:06:49,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2018-12-09 01:06:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:49,295 INFO L225 Difference]: With dead ends: 84432 [2018-12-09 01:06:49,295 INFO L226 Difference]: Without dead ends: 2257 [2018-12-09 01:06:49,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:06:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2018-12-09 01:06:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1594. [2018-12-09 01:06:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2018-12-09 01:06:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1912 transitions. [2018-12-09 01:06:49,924 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1912 transitions. Word has length 155 [2018-12-09 01:06:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:49,924 INFO L480 AbstractCegarLoop]: Abstraction has 1594 states and 1912 transitions. [2018-12-09 01:06:49,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:06:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1912 transitions. [2018-12-09 01:06:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 01:06:49,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:49,925 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-12-09 01:06:49,926 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:49,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:49,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1760373640, now seen corresponding path program 1 times [2018-12-09 01:06:49,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:49,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:49,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 01:06:50,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:06:50,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:06:50,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:06:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:06:50,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:06:50,081 INFO L87 Difference]: Start difference. First operand 1594 states and 1912 transitions. Second operand 9 states. [2018-12-09 01:06:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:50,195 INFO L93 Difference]: Finished difference Result 1670 states and 2010 transitions. [2018-12-09 01:06:50,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:06:50,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2018-12-09 01:06:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:50,198 INFO L225 Difference]: With dead ends: 1670 [2018-12-09 01:06:50,198 INFO L226 Difference]: Without dead ends: 1555 [2018-12-09 01:06:50,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:06:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-12-09 01:06:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1549. [2018-12-09 01:06:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2018-12-09 01:06:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1866 transitions. [2018-12-09 01:06:50,234 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1866 transitions. Word has length 157 [2018-12-09 01:06:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:50,235 INFO L480 AbstractCegarLoop]: Abstraction has 1549 states and 1866 transitions. [2018-12-09 01:06:50,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:06:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1866 transitions. [2018-12-09 01:06:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 01:06:50,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:50,236 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:50,236 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:50,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash -33736476, now seen corresponding path program 1 times [2018-12-09 01:06:50,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:50,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:50,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:06:50,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:06:50,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:06:50,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:06:50,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:06:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:06:50,868 INFO L87 Difference]: Start difference. First operand 1549 states and 1866 transitions. Second operand 5 states. [2018-12-09 01:06:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:50,976 INFO L93 Difference]: Finished difference Result 1936 states and 2298 transitions. [2018-12-09 01:06:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:06:50,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2018-12-09 01:06:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:50,978 INFO L225 Difference]: With dead ends: 1936 [2018-12-09 01:06:50,979 INFO L226 Difference]: Without dead ends: 1570 [2018-12-09 01:06:50,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:06:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-12-09 01:06:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1552. [2018-12-09 01:06:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2018-12-09 01:06:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1870 transitions. [2018-12-09 01:06:51,015 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1870 transitions. Word has length 165 [2018-12-09 01:06:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:51,015 INFO L480 AbstractCegarLoop]: Abstraction has 1552 states and 1870 transitions. [2018-12-09 01:06:51,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:06:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1870 transitions. [2018-12-09 01:06:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-09 01:06:51,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:51,016 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:51,016 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:51,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash -499319691, now seen corresponding path program 1 times [2018-12-09 01:06:51,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:51,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:51,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:06:51,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:06:51,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:06:51,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:06:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:06:51,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:06:51,203 INFO L87 Difference]: Start difference. First operand 1552 states and 1870 transitions. Second operand 4 states. [2018-12-09 01:06:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:51,349 INFO L93 Difference]: Finished difference Result 2594 states and 3162 transitions. [2018-12-09 01:06:51,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:06:51,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-09 01:06:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:51,352 INFO L225 Difference]: With dead ends: 2594 [2018-12-09 01:06:51,353 INFO L226 Difference]: Without dead ends: 1556 [2018-12-09 01:06:51,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:06:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-12-09 01:06:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1554. [2018-12-09 01:06:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2018-12-09 01:06:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1873 transitions. [2018-12-09 01:06:51,390 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1873 transitions. Word has length 166 [2018-12-09 01:06:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:51,390 INFO L480 AbstractCegarLoop]: Abstraction has 1554 states and 1873 transitions. [2018-12-09 01:06:51,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:06:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1873 transitions. [2018-12-09 01:06:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 01:06:51,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:51,392 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:51,392 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:51,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:51,392 INFO L82 PathProgramCache]: Analyzing trace with hash -189696958, now seen corresponding path program 1 times [2018-12-09 01:06:51,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:51,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:51,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:06:51,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:06:51,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:06:51,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:51,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:06:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:06:52,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:06:52,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-12-09 01:06:52,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:06:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:06:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:06:52,072 INFO L87 Difference]: Start difference. First operand 1554 states and 1873 transitions. Second operand 12 states. [2018-12-09 01:06:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:52,742 INFO L93 Difference]: Finished difference Result 2591 states and 3181 transitions. [2018-12-09 01:06:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:06:52,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 167 [2018-12-09 01:06:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:52,746 INFO L225 Difference]: With dead ends: 2591 [2018-12-09 01:06:52,746 INFO L226 Difference]: Without dead ends: 1554 [2018-12-09 01:06:52,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:06:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2018-12-09 01:06:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1529. [2018-12-09 01:06:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1529 states. [2018-12-09 01:06:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1827 transitions. [2018-12-09 01:06:52,783 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1827 transitions. Word has length 167 [2018-12-09 01:06:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:52,783 INFO L480 AbstractCegarLoop]: Abstraction has 1529 states and 1827 transitions. [2018-12-09 01:06:52,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:06:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1827 transitions. [2018-12-09 01:06:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:06:52,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:52,784 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:52,785 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:52,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash -569071880, now seen corresponding path program 1 times [2018-12-09 01:06:52,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:52,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:52,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:52,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:52,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 01:06:52,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:06:52,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:06:52,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:06:52,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:06:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:06:52,913 INFO L87 Difference]: Start difference. First operand 1529 states and 1827 transitions. Second operand 6 states. [2018-12-09 01:06:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:52,990 INFO L93 Difference]: Finished difference Result 2182 states and 2605 transitions. [2018-12-09 01:06:52,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:06:52,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-12-09 01:06:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:52,993 INFO L225 Difference]: With dead ends: 2182 [2018-12-09 01:06:52,993 INFO L226 Difference]: Without dead ends: 1539 [2018-12-09 01:06:52,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:06:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2018-12-09 01:06:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1499. [2018-12-09 01:06:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-12-09 01:06:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1785 transitions. [2018-12-09 01:06:53,029 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1785 transitions. Word has length 175 [2018-12-09 01:06:53,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:53,029 INFO L480 AbstractCegarLoop]: Abstraction has 1499 states and 1785 transitions. [2018-12-09 01:06:53,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:06:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1785 transitions. [2018-12-09 01:06:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 01:06:53,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:53,031 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:53,031 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:53,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash -718283004, now seen corresponding path program 1 times [2018-12-09 01:06:53,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:53,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:06:53,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:06:53,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:06:53,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:06:53,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:06:53,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:06:53,172 INFO L87 Difference]: Start difference. First operand 1499 states and 1785 transitions. Second operand 6 states. [2018-12-09 01:06:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:53,257 INFO L93 Difference]: Finished difference Result 2251 states and 2657 transitions. [2018-12-09 01:06:53,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:06:53,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-12-09 01:06:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:53,260 INFO L225 Difference]: With dead ends: 2251 [2018-12-09 01:06:53,260 INFO L226 Difference]: Without dead ends: 1468 [2018-12-09 01:06:53,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:06:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-12-09 01:06:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1430. [2018-12-09 01:06:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-12-09 01:06:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1690 transitions. [2018-12-09 01:06:53,295 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1690 transitions. Word has length 172 [2018-12-09 01:06:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:53,295 INFO L480 AbstractCegarLoop]: Abstraction has 1430 states and 1690 transitions. [2018-12-09 01:06:53,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:06:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1690 transitions. [2018-12-09 01:06:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:06:53,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:53,296 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:53,296 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:53,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:53,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1455766763, now seen corresponding path program 1 times [2018-12-09 01:06:53,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:53,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:53,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:53,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:53,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 01:06:53,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:06:53,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:06:53,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:06:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:06:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:06:53,386 INFO L87 Difference]: Start difference. First operand 1430 states and 1690 transitions. Second operand 5 states. [2018-12-09 01:06:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:53,438 INFO L93 Difference]: Finished difference Result 1495 states and 1756 transitions. [2018-12-09 01:06:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:06:53,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2018-12-09 01:06:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:06:53,440 INFO L225 Difference]: With dead ends: 1495 [2018-12-09 01:06:53,440 INFO L226 Difference]: Without dead ends: 1402 [2018-12-09 01:06:53,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:06:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-12-09 01:06:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2018-12-09 01:06:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2018-12-09 01:06:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1656 transitions. [2018-12-09 01:06:53,473 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1656 transitions. Word has length 175 [2018-12-09 01:06:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:06:53,473 INFO L480 AbstractCegarLoop]: Abstraction has 1402 states and 1656 transitions. [2018-12-09 01:06:53,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:06:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1656 transitions. [2018-12-09 01:06:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 01:06:53,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:06:53,474 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:53,474 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:06:53,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1166485477, now seen corresponding path program 1 times [2018-12-09 01:06:53,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:53,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:53,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 01:06:53,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:06:53,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:06:53,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:06:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:06:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:06:53,575 INFO L87 Difference]: Start difference. First operand 1402 states and 1656 transitions. Second operand 5 states. [2018-12-09 01:07:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:07:05,652 INFO L93 Difference]: Finished difference Result 2008 states and 2355 transitions. [2018-12-09 01:07:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:07:05,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-09 01:07:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:07:05,655 INFO L225 Difference]: With dead ends: 2008 [2018-12-09 01:07:05,655 INFO L226 Difference]: Without dead ends: 1112 [2018-12-09 01:07:05,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:07:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2018-12-09 01:07:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 912. [2018-12-09 01:07:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-12-09 01:07:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1043 transitions. [2018-12-09 01:07:05,681 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1043 transitions. Word has length 185 [2018-12-09 01:07:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:07:05,681 INFO L480 AbstractCegarLoop]: Abstraction has 912 states and 1043 transitions. [2018-12-09 01:07:05,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:07:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1043 transitions. [2018-12-09 01:07:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-09 01:07:05,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:07:05,682 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:07:05,682 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:07:05,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:07:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash 700859628, now seen corresponding path program 1 times [2018-12-09 01:07:05,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:07:05,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:07:05,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:07:05,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:07:05,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:07:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 01:07:05,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:07:05,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:07:05,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:07:05,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:07:05,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:07:05,787 INFO L87 Difference]: Start difference. First operand 912 states and 1043 transitions. Second operand 6 states. [2018-12-09 01:07:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:07:05,843 INFO L93 Difference]: Finished difference Result 940 states and 1070 transitions. [2018-12-09 01:07:05,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:07:05,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-12-09 01:07:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:07:05,844 INFO L225 Difference]: With dead ends: 940 [2018-12-09 01:07:05,844 INFO L226 Difference]: Without dead ends: 845 [2018-12-09 01:07:05,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:07:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-12-09 01:07:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 821. [2018-12-09 01:07:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-09 01:07:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 932 transitions. [2018-12-09 01:07:05,868 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 932 transitions. Word has length 204 [2018-12-09 01:07:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:07:05,868 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 932 transitions. [2018-12-09 01:07:05,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:07:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 932 transitions. [2018-12-09 01:07:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-09 01:07:05,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:07:05,869 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:07:05,869 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:07:05,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:07:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash 465490928, now seen corresponding path program 1 times [2018-12-09 01:07:05,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:07:05,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:07:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:07:05,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:07:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:07:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 01:07:06,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:07:06,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 01:07:06,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:07:06,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:07:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:07:06,037 INFO L87 Difference]: Start difference. First operand 821 states and 932 transitions. Second operand 13 states. [2018-12-09 01:07:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:07:06,538 INFO L93 Difference]: Finished difference Result 848 states and 962 transitions. [2018-12-09 01:07:06,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:07:06,539 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2018-12-09 01:07:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:07:06,540 INFO L225 Difference]: With dead ends: 848 [2018-12-09 01:07:06,540 INFO L226 Difference]: Without dead ends: 723 [2018-12-09 01:07:06,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:07:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-09 01:07:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2018-12-09 01:07:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-12-09 01:07:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 821 transitions. [2018-12-09 01:07:06,562 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 821 transitions. Word has length 194 [2018-12-09 01:07:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:07:06,563 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 821 transitions. [2018-12-09 01:07:06,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:07:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 821 transitions. [2018-12-09 01:07:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-09 01:07:06,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:07:06,564 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:07:06,564 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:07:06,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:07:06,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1668071764, now seen corresponding path program 1 times [2018-12-09 01:07:06,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:07:06,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:07:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:07:06,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:07:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:07:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-09 01:07:06,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:07:06,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 01:07:06,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 01:07:06,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 01:07:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:07:06,790 INFO L87 Difference]: Start difference. First operand 723 states and 821 transitions. Second operand 15 states. [2018-12-09 01:08:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:03,744 INFO L93 Difference]: Finished difference Result 1530 states and 1719 transitions. [2018-12-09 01:08:03,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 01:08:03,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 198 [2018-12-09 01:08:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:03,746 INFO L225 Difference]: With dead ends: 1530 [2018-12-09 01:08:03,746 INFO L226 Difference]: Without dead ends: 1092 [2018-12-09 01:08:03,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2018-12-09 01:08:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2018-12-09 01:08:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 890. [2018-12-09 01:08:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-12-09 01:08:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1009 transitions. [2018-12-09 01:08:03,776 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1009 transitions. Word has length 198 [2018-12-09 01:08:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:03,776 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1009 transitions. [2018-12-09 01:08:03,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 01:08:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1009 transitions. [2018-12-09 01:08:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 01:08:03,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:03,777 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:03,777 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:03,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1733124513, now seen corresponding path program 1 times [2018-12-09 01:08:03,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:03,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:03,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-09 01:08:03,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:03,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:08:03,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:08:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:08:03,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:08:03,868 INFO L87 Difference]: Start difference. First operand 890 states and 1009 transitions. Second operand 3 states. [2018-12-09 01:08:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:03,931 INFO L93 Difference]: Finished difference Result 909 states and 1028 transitions. [2018-12-09 01:08:03,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:08:03,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-12-09 01:08:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:03,933 INFO L225 Difference]: With dead ends: 909 [2018-12-09 01:08:03,933 INFO L226 Difference]: Without dead ends: 739 [2018-12-09 01:08:03,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:08:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-12-09 01:08:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2018-12-09 01:08:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-09 01:08:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 843 transitions. [2018-12-09 01:08:03,958 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 843 transitions. Word has length 199 [2018-12-09 01:08:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:03,958 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 843 transitions. [2018-12-09 01:08:03,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:08:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 843 transitions. [2018-12-09 01:08:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-09 01:08:03,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:03,959 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:03,959 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:03,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash 268875819, now seen corresponding path program 1 times [2018-12-09 01:08:03,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:03,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:03,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:08:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:04,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:08:04,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:08:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:08:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:08:04,128 INFO L87 Difference]: Start difference. First operand 739 states and 843 transitions. Second operand 12 states. [2018-12-09 01:08:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:04,305 INFO L93 Difference]: Finished difference Result 822 states and 955 transitions. [2018-12-09 01:08:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:08:04,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 212 [2018-12-09 01:08:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:04,307 INFO L225 Difference]: With dead ends: 822 [2018-12-09 01:08:04,307 INFO L226 Difference]: Without dead ends: 756 [2018-12-09 01:08:04,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:08:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-12-09 01:08:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 745. [2018-12-09 01:08:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-12-09 01:08:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 844 transitions. [2018-12-09 01:08:04,334 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 844 transitions. Word has length 212 [2018-12-09 01:08:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:04,334 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 844 transitions. [2018-12-09 01:08:04,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:08:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 844 transitions. [2018-12-09 01:08:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-09 01:08:04,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:04,335 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:04,335 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:04,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash -715571839, now seen corresponding path program 1 times [2018-12-09 01:08:04,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:04,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:04,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:04,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:04,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-09 01:08:04,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:04,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 01:08:04,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:08:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:08:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:08:04,511 INFO L87 Difference]: Start difference. First operand 745 states and 844 transitions. Second operand 13 states. [2018-12-09 01:08:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:04,644 INFO L93 Difference]: Finished difference Result 872 states and 983 transitions. [2018-12-09 01:08:04,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 01:08:04,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 212 [2018-12-09 01:08:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:04,645 INFO L225 Difference]: With dead ends: 872 [2018-12-09 01:08:04,645 INFO L226 Difference]: Without dead ends: 758 [2018-12-09 01:08:04,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:08:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-12-09 01:08:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 749. [2018-12-09 01:08:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-12-09 01:08:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 848 transitions. [2018-12-09 01:08:04,673 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 848 transitions. Word has length 212 [2018-12-09 01:08:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:04,673 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 848 transitions. [2018-12-09 01:08:04,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:08:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 848 transitions. [2018-12-09 01:08:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-09 01:08:04,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:04,675 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:04,675 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:04,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 215208960, now seen corresponding path program 1 times [2018-12-09 01:08:04,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:04,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:04,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:04,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-09 01:08:04,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:04,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 01:08:04,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:08:04,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:08:04,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:08:04,847 INFO L87 Difference]: Start difference. First operand 749 states and 848 transitions. Second operand 13 states. [2018-12-09 01:08:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:05,236 INFO L93 Difference]: Finished difference Result 753 states and 851 transitions. [2018-12-09 01:08:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:08:05,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 212 [2018-12-09 01:08:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:05,237 INFO L225 Difference]: With dead ends: 753 [2018-12-09 01:08:05,237 INFO L226 Difference]: Without dead ends: 575 [2018-12-09 01:08:05,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:08:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-12-09 01:08:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2018-12-09 01:08:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-12-09 01:08:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 650 transitions. [2018-12-09 01:08:05,257 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 650 transitions. Word has length 212 [2018-12-09 01:08:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:05,257 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 650 transitions. [2018-12-09 01:08:05,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:08:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 650 transitions. [2018-12-09 01:08:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-09 01:08:05,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:05,258 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:05,258 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:05,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1878163309, now seen corresponding path program 1 times [2018-12-09 01:08:05,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:05,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:05,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:05,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:05,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 01:08:05,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:05,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 01:08:05,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:08:05,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:08:05,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:08:05,412 INFO L87 Difference]: Start difference. First operand 575 states and 650 transitions. Second operand 10 states. [2018-12-09 01:08:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:05,669 INFO L93 Difference]: Finished difference Result 1073 states and 1213 transitions. [2018-12-09 01:08:05,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:08:05,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-12-09 01:08:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:05,671 INFO L225 Difference]: With dead ends: 1073 [2018-12-09 01:08:05,672 INFO L226 Difference]: Without dead ends: 973 [2018-12-09 01:08:05,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:08:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2018-12-09 01:08:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 425. [2018-12-09 01:08:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-09 01:08:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2018-12-09 01:08:05,691 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 462 transitions. Word has length 221 [2018-12-09 01:08:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:05,691 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 462 transitions. [2018-12-09 01:08:05,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:08:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 462 transitions. [2018-12-09 01:08:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-09 01:08:05,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:05,692 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:05,692 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:05,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1990034264, now seen corresponding path program 1 times [2018-12-09 01:08:05,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:05,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:05,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:05,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:05,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 01:08:05,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:05,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:08:05,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:08:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:08:05,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:08:05,797 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand 4 states. [2018-12-09 01:08:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:05,912 INFO L93 Difference]: Finished difference Result 557 states and 608 transitions. [2018-12-09 01:08:05,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:08:05,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2018-12-09 01:08:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:05,914 INFO L225 Difference]: With dead ends: 557 [2018-12-09 01:08:05,914 INFO L226 Difference]: Without dead ends: 450 [2018-12-09 01:08:05,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:08:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-09 01:08:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 422. [2018-12-09 01:08:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-09 01:08:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 458 transitions. [2018-12-09 01:08:05,934 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 458 transitions. Word has length 253 [2018-12-09 01:08:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:05,934 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 458 transitions. [2018-12-09 01:08:05,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:08:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 458 transitions. [2018-12-09 01:08:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-09 01:08:05,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:05,935 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:05,936 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:05,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1326550120, now seen corresponding path program 1 times [2018-12-09 01:08:05,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:05,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:05,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 01:08:06,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:06,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:08:06,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:08:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:08:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:08:06,047 INFO L87 Difference]: Start difference. First operand 422 states and 458 transitions. Second operand 5 states. [2018-12-09 01:08:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:06,081 INFO L93 Difference]: Finished difference Result 515 states and 553 transitions. [2018-12-09 01:08:06,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:08:06,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2018-12-09 01:08:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:06,082 INFO L225 Difference]: With dead ends: 515 [2018-12-09 01:08:06,083 INFO L226 Difference]: Without dead ends: 428 [2018-12-09 01:08:06,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:08:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-09 01:08:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2018-12-09 01:08:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-12-09 01:08:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 462 transitions. [2018-12-09 01:08:06,102 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 462 transitions. Word has length 255 [2018-12-09 01:08:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:06,102 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 462 transitions. [2018-12-09 01:08:06,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:08:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 462 transitions. [2018-12-09 01:08:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-09 01:08:06,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:06,103 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:06,104 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:06,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash -473983657, now seen corresponding path program 1 times [2018-12-09 01:08:06,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:06,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:06,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:06,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:06,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 01:08:06,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:06,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:08:06,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:08:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:08:06,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:08:06,217 INFO L87 Difference]: Start difference. First operand 426 states and 462 transitions. Second operand 5 states. [2018-12-09 01:08:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:06,262 INFO L93 Difference]: Finished difference Result 579 states and 631 transitions. [2018-12-09 01:08:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:08:06,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2018-12-09 01:08:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:06,263 INFO L225 Difference]: With dead ends: 579 [2018-12-09 01:08:06,263 INFO L226 Difference]: Without dead ends: 424 [2018-12-09 01:08:06,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:08:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-09 01:08:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-12-09 01:08:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-09 01:08:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-12-09 01:08:06,283 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 255 [2018-12-09 01:08:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:06,283 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-12-09 01:08:06,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:08:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-12-09 01:08:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-12-09 01:08:06,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:06,285 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:06,285 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:06,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:06,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1472757941, now seen corresponding path program 1 times [2018-12-09 01:08:06,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:06,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:06,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-09 01:08:06,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:08:06,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 01:08:06,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 01:08:06,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 01:08:06,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:08:06,528 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 14 states. [2018-12-09 01:08:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:08,714 INFO L93 Difference]: Finished difference Result 490 states and 541 transitions. [2018-12-09 01:08:08,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 01:08:08,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 287 [2018-12-09 01:08:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:08,715 INFO L225 Difference]: With dead ends: 490 [2018-12-09 01:08:08,715 INFO L226 Difference]: Without dead ends: 433 [2018-12-09 01:08:08,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-09 01:08:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-12-09 01:08:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 424. [2018-12-09 01:08:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-09 01:08:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 458 transitions. [2018-12-09 01:08:08,734 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 458 transitions. Word has length 287 [2018-12-09 01:08:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:08,734 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 458 transitions. [2018-12-09 01:08:08,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 01:08:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 458 transitions. [2018-12-09 01:08:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-12-09 01:08:08,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:08,735 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:08,735 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:08,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1612760525, now seen corresponding path program 1 times [2018-12-09 01:08:08,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:08,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:08,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:08,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:08,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 01:08:09,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:08:09,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:08:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:09,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:08:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-09 01:08:09,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:08:09,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2018-12-09 01:08:09,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 01:08:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 01:08:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-12-09 01:08:09,900 INFO L87 Difference]: Start difference. First operand 424 states and 458 transitions. Second operand 27 states. [2018-12-09 01:08:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:10,133 INFO L93 Difference]: Finished difference Result 492 states and 541 transitions. [2018-12-09 01:08:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 01:08:10,134 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 290 [2018-12-09 01:08:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:10,135 INFO L225 Difference]: With dead ends: 492 [2018-12-09 01:08:10,135 INFO L226 Difference]: Without dead ends: 420 [2018-12-09 01:08:10,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-12-09 01:08:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-12-09 01:08:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 405. [2018-12-09 01:08:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-12-09 01:08:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 432 transitions. [2018-12-09 01:08:10,154 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 432 transitions. Word has length 290 [2018-12-09 01:08:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:10,154 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 432 transitions. [2018-12-09 01:08:10,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 01:08:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 432 transitions. [2018-12-09 01:08:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-12-09 01:08:10,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:08:10,155 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:08:10,155 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:08:10,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:08:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1586105132, now seen corresponding path program 1 times [2018-12-09 01:08:10,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:08:10,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:08:10,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:10,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:10,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:08:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 01:08:10,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:08:10,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:08:10,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:08:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:10,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:08:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-09 01:08:11,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:08:11,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2018-12-09 01:08:11,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 01:08:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 01:08:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-12-09 01:08:11,072 INFO L87 Difference]: Start difference. First operand 405 states and 432 transitions. Second operand 27 states. [2018-12-09 01:08:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:08:11,307 INFO L93 Difference]: Finished difference Result 422 states and 452 transitions. [2018-12-09 01:08:11,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 01:08:11,308 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 295 [2018-12-09 01:08:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:08:11,308 INFO L225 Difference]: With dead ends: 422 [2018-12-09 01:08:11,308 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:08:11,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-12-09 01:08:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:08:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:08:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:08:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:08:11,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2018-12-09 01:08:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:08:11,309 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:08:11,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 01:08:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:08:11,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:08:11,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 01:08:11,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:11,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:12,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:13,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,492 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-12-09 01:08:14,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:14,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:15,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:16,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:17,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:18,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:19,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:20,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:08:21,135 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 65 [2018-12-09 01:08:21,490 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2018-12-09 01:08:21,863 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2018-12-09 01:08:23,018 WARN L180 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 54 [2018-12-09 01:08:23,225 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-12-09 01:08:23,889 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-12-09 01:08:24,071 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2018-12-09 01:08:24,237 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-12-09 01:08:24,434 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 1 [2018-12-09 01:08:24,933 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2018-12-09 01:08:25,544 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 1 [2018-12-09 01:08:26,382 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2018-12-09 01:08:26,701 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 26 [2018-12-09 01:08:27,242 WARN L180 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 58 [2018-12-09 01:08:27,484 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-09 01:08:27,793 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2018-12-09 01:08:28,467 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2018-12-09 01:08:29,152 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2018-12-09 01:08:29,278 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 34 [2018-12-09 01:08:29,381 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2018-12-09 01:08:29,601 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 1 [2018-12-09 01:08:30,057 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2018-12-09 01:08:30,348 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 29 [2018-12-09 01:08:30,851 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 1 [2018-12-09 01:08:31,577 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 54 [2018-12-09 01:08:32,066 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-09 01:08:32,230 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-12-09 01:08:32,424 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2018-12-09 01:08:32,525 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2018-12-09 01:08:32,864 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-12-09 01:08:32,985 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2018-12-09 01:08:33,415 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 1 [2018-12-09 01:08:34,203 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2018-12-09 01:08:34,315 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2018-12-09 01:08:34,651 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2018-12-09 01:08:34,950 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2018-12-09 01:08:35,312 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2018-12-09 01:08:35,722 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 64 [2018-12-09 01:08:36,086 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 64 [2018-12-09 01:08:36,715 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-09 01:08:36,962 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2018-12-09 01:08:37,186 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-09 01:08:37,390 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-09 01:08:37,962 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2018-12-09 01:08:38,101 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2018-12-09 01:08:38,852 WARN L180 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2018-12-09 01:08:39,145 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-12-09 01:08:39,567 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2018-12-09 01:08:39,788 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-12-09 01:08:40,152 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 1 [2018-12-09 01:08:40,423 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2018-12-09 01:08:41,172 WARN L180 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2018-12-09 01:08:41,347 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-12-09 01:08:41,460 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2018-12-09 01:08:42,245 WARN L180 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 54 [2018-12-09 01:08:42,387 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2018-12-09 01:08:43,005 WARN L180 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-12-09 01:08:43,167 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2018-12-09 01:08:43,345 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2018-12-09 01:08:43,666 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2018-12-09 01:08:43,847 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2018-12-09 01:08:43,990 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 1 [2018-12-09 01:08:44,289 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 32 [2018-12-09 01:08:44,735 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2018-12-09 01:08:44,865 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2018-12-09 01:08:45,813 WARN L180 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2018-12-09 01:08:46,044 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2018-12-09 01:08:46,192 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 31 [2018-12-09 01:08:46,515 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 21272 21287) no Hoare annotation was computed. [2018-12-09 01:08:46,515 INFO L451 ceAbstractionStarter]: At program point IoGetConfigurationInformationENTRY(lines 21272 21287) the Hoare annotation is: true [2018-12-09 01:08:46,515 INFO L448 ceAbstractionStarter]: For program point L21280-1(line 21280) no Hoare annotation was computed. [2018-12-09 01:08:46,515 INFO L451 ceAbstractionStarter]: At program point L21280(line 21280) the Hoare annotation is: true [2018-12-09 01:08:46,515 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 21272 21287) no Hoare annotation was computed. [2018-12-09 01:08:46,515 INFO L448 ceAbstractionStarter]: For program point L20602-1(line 20602) no Hoare annotation was computed. [2018-12-09 01:08:46,515 INFO L448 ceAbstractionStarter]: For program point L20466(lines 20466 20470) no Hoare annotation was computed. [2018-12-09 01:08:46,515 INFO L444 ceAbstractionStarter]: At program point L20544(lines 20540 20592) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,515 INFO L448 ceAbstractionStarter]: For program point L20540(lines 20540 20592) no Hoare annotation was computed. [2018-12-09 01:08:46,515 INFO L444 ceAbstractionStarter]: At program point L20602(line 20602) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,515 INFO L448 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 20364 20630) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L444 ceAbstractionStarter]: At program point L20623(lines 20449 20624) the Hoare annotation is: (let ((.cse8 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (= |old(~compRegistered~0)| 0)) (.cse11 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse8 .cse9 .cse10 .cse11)) (.cse1 (= 0 ~pended~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse2 (= FloppyProcessQueuedRequests_~__cil_tmp17~25 0)) (.cse3 (= FloppyProcessQueuedRequests_~headOfList~0.offset 0)) (.cse5 (= 1 ~s~0)) (.cse6 (= FloppyProcessQueuedRequests_~headOfList~0.base 0)) (.cse7 (= ~PagingReferenceCount~0 1))) (and (or (= 0 ~myStatus~0) .cse0 (not (= |old(~myStatus~0)| 0)) (not (= |old(~customIrp~0)| 0))) (or (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7) .cse0) (or (not (= |old(~setEventCalled~0)| 1)) .cse8 .cse9 (= 1 ~setEventCalled~0) .cse10 .cse11) (or .cse8 (not .cse10) .cse9 (and .cse1 .cse4 .cse2 .cse3 .cse5 .cse6 .cse7) .cse11)))) [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point L20570-1(line 20570) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L444 ceAbstractionStarter]: At program point L20450-2(lines 20450 20622) the Hoare annotation is: (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse6 (= |old(~compRegistered~0)| 0)) (.cse8 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse5 .cse7 .cse6 .cse8)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= ~PagingReferenceCount~0 1))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (= 0 ~myStatus~0) (not (= |old(~customIrp~0)| 0))) (or .cse0 (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse2) .cse3 .cse4)) (or .cse5 (not .cse6) .cse7 (and .cse1 .cse2 .cse3 .cse4) .cse8) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse7 (= 1 ~setEventCalled~0) .cse6 .cse8)))) [2018-12-09 01:08:46,516 INFO L444 ceAbstractionStarter]: At program point L20570(line 20570) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,516 INFO L444 ceAbstractionStarter]: At program point L20550(lines 20549 20589) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,516 INFO L444 ceAbstractionStarter]: At program point L20517-1(lines 20450 20622) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point L20517(lines 20517 20599) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point L20546(lines 20546 20590) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point L20451(line 20451) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point L20459-1(line 20459) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point $Ultimate##23(lines 20551 20588) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L444 ceAbstractionStarter]: At program point L20459(line 20459) the Hoare annotation is: (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse6 (= |old(~compRegistered~0)| 0)) (.cse8 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse5 .cse7 .cse6 .cse8)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= ~PagingReferenceCount~0 1))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (= 0 ~myStatus~0) (not (= |old(~customIrp~0)| 0))) (or .cse0 (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse2) .cse3 .cse4)) (or .cse5 (not .cse6) .cse7 (and .cse1 .cse2 .cse3 .cse4) .cse8) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse7 (= 1 ~setEventCalled~0) .cse6 .cse8)))) [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 20551 20588) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point L20600(lines 20600 20618) no Hoare annotation was computed. [2018-12-09 01:08:46,516 INFO L444 ceAbstractionStarter]: At program point L20534(line 20534) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,516 INFO L444 ceAbstractionStarter]: At program point L20608(line 20608) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,516 INFO L448 ceAbstractionStarter]: For program point L20608-1(line 20608) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point L20584(line 20584) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point FloppyProcessQueuedRequestsENTRY(lines 20364 20630) the Hoare annotation is: (let ((.cse5 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= |old(~compRegistered~0)| 0)) (.cse8 (not (= 1 |old(~s~0)|)))) (let ((.cse0 (or .cse5 .cse6 .cse7 .cse8)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (= ~PagingReferenceCount~0 1))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) (= 0 ~myStatus~0) (not (= |old(~customIrp~0)| 0))) (or .cse0 (and .cse1 (= ~customIrp~0 |old(~customIrp~0)|) (not .cse2) .cse3 .cse4)) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 .cse7 .cse8 (= 1 ~setEventCalled~0)) (or .cse5 (not .cse7) .cse6 (and .cse1 .cse2 .cse3 .cse4) .cse8)))) [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point L20547(lines 20546 20590) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L20543(lines 20543 20591) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L20605(lines 20605 20612) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point L20605-2(lines 20605 20612) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L20490-1(line 20490) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 20364 20630) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point L20560(line 20560) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L20494(lines 20494 20512) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L20560-1(line 20560) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L20494-2(lines 20494 20512) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point L20490(line 20490) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= 0 |old(~pended~0)|)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L20523(lines 20523 20594) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L7699-1(line 7699) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point L7699(line 7699) the Hoare annotation is: (let ((.cse4 (= 1 ~setEventCalled~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse6 (= ~s~0 4)) (.cse3 (= 0 ~pended~0)) (.cse2 (= 2 ~s~0)) (.cse5 (= 0 ~PagingReferenceCount~0)) (.cse1 (not (= FloppyPnp_~ntStatus~3 259)))) (or (and .cse0 .cse1 .cse2) (and (= 6 ~s~0) (and .cse3 (not .cse0) .cse4 .cse5)) (and (or (and .cse3 .cse4 .cse6 .cse5) (and .cse3 .cse0 .cse6)) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 (= ~pended~0 1) (= 0 ~customIrp~0) .cse6) (and (and .cse3 .cse2 .cse5) .cse1))) [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L7600-1(line 7600) no Hoare annotation was computed. [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point L7600(line 7600) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,517 INFO L444 ceAbstractionStarter]: At program point L6923-1(lines 6923 6930) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,517 INFO L448 ceAbstractionStarter]: For program point L6923(lines 6923 6930) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L6989(lines 6985 7687) 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-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7204loopEntry(lines 7204 7207) 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-12-09 01:08:46,518 INFO L448 ceAbstractionStarter]: For program point L7105-1(lines 7105 7106) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7105(lines 7105 7106) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (<= FloppyPnp_~ntStatus~3 259)) (.cse4 (<= 259 FloppyPnp_~ntStatus~3))) (or (and (= 0 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) .cse3 .cse4))) [2018-12-09 01:08:46,518 INFO L448 ceAbstractionStarter]: For program point L7485-1(line 7485) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7485(line 7485) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7502(line 7502) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7023loopEntry(lines 7023 7026) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,518 INFO L448 ceAbstractionStarter]: For program point L7502-1(lines 6999 7680) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L448 ceAbstractionStarter]: For program point L7139(lines 7139 7145) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L448 ceAbstractionStarter]: For program point L7073-1(line 7073) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7073(line 7073) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7123(line 7123) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= 1 ~s~0)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (<= FloppyPnp_~ntStatus~3 259)) (.cse4 (<= 259 FloppyPnp_~ntStatus~3))) (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) .cse3 .cse4) (and (= 0 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7470(line 7470) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,518 INFO L448 ceAbstractionStarter]: For program point L6991(lines 6991 7685) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L448 ceAbstractionStarter]: For program point L7470-1(line 7470) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L448 ceAbstractionStarter]: For program point L7041-1(lines 7037 7043) no Hoare annotation was computed. [2018-12-09 01:08:46,518 INFO L444 ceAbstractionStarter]: At program point L7041(line 7041) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7190(line 7190) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (not (= FloppyPnp_~ntStatus~3 259))) (.cse2 (= 1 ~s~0))) (or (and .cse0 .cse1 .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) (and (= 0 ~pended~0) .cse0 .cse1 .cse2) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L6926(line 6926) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7438(line 7438) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L6992(lines 6991 7685) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,519 INFO L448 ceAbstractionStarter]: For program point L7438-1(lines 7434 7440) no Hoare annotation was computed. [2018-12-09 01:08:46,519 INFO L448 ceAbstractionStarter]: For program point L7587-1(line 7587) no Hoare annotation was computed. [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7587(line 7587) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,519 INFO L448 ceAbstractionStarter]: For program point L6976(lines 6976 7690) no Hoare annotation was computed. [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7092-1(line 7092) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7571(line 7571) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,519 INFO L448 ceAbstractionStarter]: For program point L7604-1(line 7604) no Hoare annotation was computed. [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7092(line 7092) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7604(line 7604) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,519 INFO L448 ceAbstractionStarter]: For program point L7307-1(lines 7269 7414) no Hoare annotation was computed. [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7307(line 7307) the Hoare annotation is: (or (let ((.cse0 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse0) 112)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse0 0)) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,519 INFO L448 ceAbstractionStarter]: For program point L7373-1(line 7373) no Hoare annotation was computed. [2018-12-09 01:08:46,519 INFO L444 ceAbstractionStarter]: At program point L7373(line 7373) the Hoare annotation is: (or (let ((.cse0 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~customIrp~0) (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse0) 112)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse0 0)) (= 0 ~myStatus~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7175-1(line 7175) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L7175(line 7175) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= 3 ~s~0)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (<= FloppyPnp_~ntStatus~3 259)) (.cse4 (<= 259 FloppyPnp_~ntStatus~3))) (or (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= (mod ~PagingReferenceCount~0 4294967296) 0)) .cse3 .cse4) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L7621-1(line 7621) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L7621(line 7621) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L7423(lines 7418 7424) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L6977(lines 6976 7690) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7225(lines 7225 7414) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L6994(lines 6994 7684) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L7027(lines 7013 7029) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7093(line 7093) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7143-1(lines 7139 7145) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L7622(line 7622) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L7143(line 7143) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7556-1(lines 7556 7575) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7556(lines 7556 7575) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 6487 7709) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7705(line 7705) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L444 ceAbstractionStarter]: At program point L6995(lines 6994 7684) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7375(lines 7375 7387) no Hoare annotation was computed. [2018-12-09 01:08:46,520 INFO L448 ceAbstractionStarter]: For program point L7375-2(lines 7375 7387) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point L7623(line 7623) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point L6979(lines 6979 7689) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point L7392-1(line 7392) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L7392(line 7392) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~myStatus~0) (let ((.cse4 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse4 0)) .cse0 .cse1 .cse2 .cse3 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse4) 112)))) (= 0 ~customIrp~0)))) [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L6913loopEntry(lines 6913 6916) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0))) [2018-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point L7095(lines 7095 7192) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L7640(lines 6999 7680) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point L6963-1(line 6963) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L6963(line 6963) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point L7508-1(lines 7504 7510) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L7508(line 7508) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 6487 7709) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point L7013(lines 7013 7029) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L7311(line 7311) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L7212loopEntry(lines 7212 7215) 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-12-09 01:08:46,521 INFO L448 ceAbstractionStarter]: For program point L7493-1(line 7493) no Hoare annotation was computed. [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L7493(line 7493) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,521 INFO L444 ceAbstractionStarter]: At program point L6998(lines 6997 7683) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L6932(line 6932) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 6999 7682) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L6982(lines 6982 7688) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L444 ceAbstractionStarter]: At program point L7015loopEntry(lines 7015 7018) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 6999 7682) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L444 ceAbstractionStarter]: At program point L7610(line 7610) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,522 INFO L444 ceAbstractionStarter]: At program point L7412(line 7412) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~myStatus~0) (let ((.cse4 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse4 0)) .cse0 .cse1 .cse2 .cse3 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse4) 112)))) (= 0 ~customIrp~0)))) [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L7693(line 7693) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L444 ceAbstractionStarter]: At program point L6983(lines 6979 7689) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L7561-1(line 7561) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L444 ceAbstractionStarter]: At program point L7561(line 7561) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,522 INFO L444 ceAbstractionStarter]: At program point L6917(lines 6912 6918) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0))) [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L7231(lines 7231 7237) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L444 ceAbstractionStarter]: At program point L7479(lines 7474 7480) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L7545-1(line 7545) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L444 ceAbstractionStarter]: At program point L7545(line 7545) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L7314(lines 7314 7321) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L7314-1(lines 7309 7322) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L7595-1(lines 7595 7614) no Hoare annotation was computed. [2018-12-09 01:08:46,522 INFO L448 ceAbstractionStarter]: For program point L7116-1(lines 7116 7127) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7595(lines 7595 7614) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7116(lines 7116 7127) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L6951(lines 6951 6968) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L444 ceAbstractionStarter]: At program point L7678(line 7678) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7678-1(line 7678) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7381-1(lines 7381 7382) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L444 ceAbstractionStarter]: At program point L7381(lines 7381 7382) the Hoare annotation is: (let ((.cse10 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~customIrp~0)) (.cse2 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse10) 112))) (.cse3 (or (and (<= 0 (+ FloppyPnp_~__cil_tmp164~2 2147483648)) (<= (+ FloppyPnp_~__cil_tmp164~2 1) 0)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse10 0)))) (.cse4 (= 0 ~myStatus~0)) (.cse5 (not (= 0 ~compRegistered~0))) (.cse6 (= 1 ~setEventCalled~0)) (.cse7 (= ~PagingReferenceCount~0 1)) (.cse8 (<= FloppyPnp_~ntStatus~3 259)) (.cse9 (<= 259 FloppyPnp_~ntStatus~3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~s~0) .cse6 .cse7 .cse8 .cse9) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 6 ~s~0) .cse5 .cse6 .cse7 .cse8 .cse9)))) [2018-12-09 01:08:46,523 INFO L444 ceAbstractionStarter]: At program point L7216(lines 7202 7218) 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-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7084-1(line 7084) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L444 ceAbstractionStarter]: At program point L7084(line 7084) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L6985(lines 6985 7687) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L444 ceAbstractionStarter]: At program point L7646(line 7646) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7002(line 7002) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7646-1(lines 7642 7648) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L444 ceAbstractionStarter]: At program point L7316(line 7316) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,523 INFO L444 ceAbstractionStarter]: At program point L7696-2(lines 7696 7703) the Hoare annotation is: (let ((.cse4 (= 1 ~setEventCalled~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse6 (= ~s~0 4)) (.cse3 (= 0 ~pended~0)) (.cse2 (= 2 ~s~0)) (.cse5 (= 0 ~PagingReferenceCount~0)) (.cse1 (not (= FloppyPnp_~ntStatus~3 259)))) (or (and .cse0 .cse1 .cse2) (and (= 6 ~s~0) (and .cse3 (not .cse0) .cse4 .cse5)) (and (or (and .cse3 .cse4 .cse6 .cse5) (and .cse3 .cse0 .cse6)) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (and .cse0 (= ~pended~0 1) (= 0 ~customIrp~0) .cse6) (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 (and .cse3 .cse2 .cse5) .cse1))) [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7696(lines 7696 7703) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L6920(line 6920) no Hoare annotation was computed. [2018-12-09 01:08:46,523 INFO L448 ceAbstractionStarter]: For program point L7267-1(line 7267) no Hoare annotation was computed. [2018-12-09 01:08:46,524 INFO L444 ceAbstractionStarter]: At program point L7267(line 7267) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 3 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,524 INFO L444 ceAbstractionStarter]: At program point L7300-1(line 7300) the Hoare annotation is: (or (let ((.cse0 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse0) 112)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse0 0)) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,524 INFO L444 ceAbstractionStarter]: At program point L7300(line 7300) the Hoare annotation is: (or (let ((.cse0 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse0) 112)) (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse0 0)) (= 0 ~myStatus~0) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,524 INFO L448 ceAbstractionStarter]: For program point L7036(lines 7036 7078) no Hoare annotation was computed. [2018-12-09 01:08:46,524 INFO L448 ceAbstractionStarter]: For program point L7581-1(line 7581) no Hoare annotation was computed. [2018-12-09 01:08:46,524 INFO L444 ceAbstractionStarter]: At program point L7581(line 7581) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,524 INFO L448 ceAbstractionStarter]: For program point L7565-1(line 7565) no Hoare annotation was computed. [2018-12-09 01:08:46,524 INFO L444 ceAbstractionStarter]: At program point L7565(line 7565) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1) (= ~s~0 4))) [2018-12-09 01:08:46,524 INFO L444 ceAbstractionStarter]: At program point L7400-1(line 7400) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~myStatus~0) (let ((.cse4 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse4 0)) .cse0 .cse1 .cse2 .cse3 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse4) 112)))) (= 0 ~customIrp~0)))) [2018-12-09 01:08:46,525 INFO L444 ceAbstractionStarter]: At program point L7400(line 7400) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (not (= 0 ~compRegistered~0))) (.cse2 (= 1 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (and .cse0 (not (= FloppyPnp_~ntStatus~3 259)) .cse1 .cse2 (= 1 ~setEventCalled~0) .cse3) (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~myStatus~0) (let ((.cse4 (div FloppyPnp_~__cil_tmp164~2 4294967296))) (and (and (<= 112 FloppyPnp_~__cil_tmp164~2) (<= .cse4 0)) .cse0 .cse1 .cse2 .cse3 (<= FloppyPnp_~__cil_tmp164~2 (+ (* 4294967296 .cse4) 112)))) (= 0 ~customIrp~0)))) [2018-12-09 01:08:46,525 INFO L448 ceAbstractionStarter]: For program point L7202(lines 7202 7218) no Hoare annotation was computed. [2018-12-09 01:08:46,525 INFO L448 ceAbstractionStarter]: For program point L7235-1(lines 7231 7237) no Hoare annotation was computed. [2018-12-09 01:08:46,525 INFO L444 ceAbstractionStarter]: At program point L7235(line 7235) the Hoare annotation is: (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,525 INFO L448 ceAbstractionStarter]: For program point L7301(line 7301) no Hoare annotation was computed. [2018-12-09 01:08:46,525 INFO L444 ceAbstractionStarter]: At program point L7681(lines 6999 7682) the Hoare annotation is: (let ((.cse7 (= ~PagingReferenceCount~0 1)) (.cse4 (= 0 ~pended~0)) (.cse8 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (.cse1 (= 0 ~customIrp~0)) (.cse3 (= ~s~0 4)) (.cse0 (= 0 ~compRegistered~0)) (.cse5 (not (= FloppyPnp_~ntStatus~3 259))) (.cse6 (= 2 ~s~0)) (.cse2 (not (= (mod ~PagingReferenceCount~0 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 (= ~pended~0 1) .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse4 (= 6 ~s~0) (not .cse0) (= 1 ~setEventCalled~0) .cse7) (and (and .cse4 .cse6 .cse7) (not (= 259 FloppyPnp_~ntStatus~3))) (and .cse4 .cse0 .cse8 .cse7 .cse3) (and .cse4 .cse0 .cse8 .cse1 .cse3) (and .cse0 .cse5 .cse6 .cse2))) [2018-12-09 01:08:46,525 INFO L448 ceAbstractionStarter]: For program point L7037(lines 7037 7043) no Hoare annotation was computed. [2018-12-09 01:08:46,525 INFO L448 ceAbstractionStarter]: For program point L7434(lines 7434 7440) no Hoare annotation was computed. [2018-12-09 01:08:46,525 INFO L448 ceAbstractionStarter]: For program point L6988(lines 6988 7686) no Hoare annotation was computed. [2018-12-09 01:08:46,525 INFO L448 ceAbstractionStarter]: For program point L7401(line 7401) no Hoare annotation was computed. [2018-12-09 01:08:46,525 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 6487 7709) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0))) [2018-12-09 01:08:46,526 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))) (let ((.cse5 (and .cse0 .cse1 (= 1 ~s~0))) (.cse2 (not (= |old(~compRegistered~0)| 0))) (.cse3 (not (= 0 |old(~pended~0)|))) (.cse4 (not (= 1 |old(~s~0)|)))) (and (or (and .cse0 .cse1 (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0)) (or (not (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse2 .cse3 (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) .cse4)) (or .cse5 .cse2 .cse3 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse4) (or .cse5 (not (= |#funAddr~FloppyPower.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse2 (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|)) .cse3 .cse4) (or .cse5 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse2 .cse3 .cse4)))) [2018-12-09 01:08:46,526 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,526 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,526 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|)) .cse0 (not (= |#funAddr~FloppyPower.base| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.base|)) .cse1 .cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0))) (or (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0 .cse1 .cse2) (or .cse0 .cse1 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .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-12-09 01:08:46,526 INFO L448 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,526 INFO L448 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,526 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 .cse0 .cse1 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .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))) [2018-12-09 01:08:46,526 INFO L448 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,526 INFO L448 ceAbstractionStarter]: For program point L-1-8(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,527 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 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) .cse0 .cse1 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .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-12-09 01:08:46,527 INFO L448 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,527 INFO L448 ceAbstractionStarter]: For program point L-1-12(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,527 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 .cse0 .cse1 (not (= |#funAddr~FloppyDeviceControl.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .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-12-09 01:08:46,527 INFO L448 ceAbstractionStarter]: For program point L-1-14(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,527 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-12-09 01:08:46,527 INFO L448 ceAbstractionStarter]: For program point L-1-17(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,527 INFO L448 ceAbstractionStarter]: For program point L-1-18(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,527 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,528 INFO L444 ceAbstractionStarter]: At program point L20821(line 20821) the Hoare annotation is: (let ((.cse5 (= 1 ~setEventCalled~0)) (.cse7 (= main_~status~4 ~lowerDriverReturn~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (= ~s~0 4)) (.cse0 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~26.base)) (.cse1 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~26.offset)) (.cse2 (= 0 ~pended~0)) (.cse9 (= 2 ~s~0)) (.cse4 (= main_~__cil_tmp14~23 1)) (.cse6 (= 0 ~PagingReferenceCount~0)) (.cse10 (not (= 259 main_~status~4)))) (or (and .cse0 .cse1 .cse2 (= 6 ~s~0) (not .cse3) .cse4 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse7 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse6)) (and .cse3 .cse9 .cse10) (and (and .cse0 .cse1 .cse3 .cse4 .cse8) (= ~pended~0 1) (= 0 ~customIrp~0)) (and .cse7 .cse2 .cse3 .cse8) (not (= |old(~compRegistered~0)| 0)) (= 1 ~s~0) (not (= 0 |old(~pended~0)|)) (and (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse6) .cse10) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 01:08:46,528 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20692 20905) no Hoare annotation was computed. [2018-12-09 01:08:46,528 INFO L444 ceAbstractionStarter]: At program point L20862(lines 20851 20891) the Hoare annotation is: (let ((.cse4 (not (= 259 main_~status~4))) (.cse2 (= 0 ~compRegistered~0)) (.cse7 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~26.base)) (.cse8 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~26.offset)) (.cse5 (= 0 ~pended~0)) (.cse9 (= main_~__cil_tmp14~23 1)) (.cse6 (= ~s~0 4)) (.cse10 (= 0 ~PagingReferenceCount~0))) (let ((.cse0 (= main_~status~4 ~lowerDriverReturn~0)) (.cse1 (let ((.cse11 (or (<= 2 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0))) (.cse12 (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0)) (.cse13 (= 1 ~setEventCalled~0))) (or (and .cse7 .cse8 .cse2 .cse9 .cse6 .cse11) (and .cse7 .cse8 .cse5 (not (= 6 ~s~0)) (not .cse2) .cse9 .cse12 .cse13 .cse4 .cse10) (and .cse5 .cse2 .cse9 .cse6 .cse11) (and .cse7 .cse8 .cse5 .cse9 .cse12 .cse13 .cse6 .cse10)))) (.cse3 (= 2 ~s~0))) (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (= ~pended~0 1) (= 0 ~customIrp~0) .cse1) (and (and .cse7 .cse8 .cse5 .cse3 .cse9 .cse10) .cse4) (not (= |old(~customIrp~0)| 0))))) [2018-12-09 01:08:46,528 INFO L444 ceAbstractionStarter]: At program point L20763(lines 20762 20816) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,528 INFO L448 ceAbstractionStarter]: For program point L20838(lines 20838 20842) no Hoare annotation was computed. [2018-12-09 01:08:46,528 INFO L448 ceAbstractionStarter]: For program point L20871(lines 20871 20877) no Hoare annotation was computed. [2018-12-09 01:08:46,528 INFO L444 ceAbstractionStarter]: At program point L20772(lines 20771 20813) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,528 INFO L448 ceAbstractionStarter]: For program point L20739(lines 20739 20747) no Hoare annotation was computed. [2018-12-09 01:08:46,528 INFO L444 ceAbstractionStarter]: At program point L20780(line 20780) the Hoare annotation is: (or (and (= |#funAddr~FloppyCreateClose.offset| main_~__cil_tmp15~25.offset) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,529 INFO L448 ceAbstractionStarter]: For program point L20780-1(line 20780) no Hoare annotation was computed. [2018-12-09 01:08:46,529 INFO L444 ceAbstractionStarter]: At program point L20739-2(lines 20739 20747) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= 1 ~s~0) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0))) [2018-12-09 01:08:46,529 INFO L448 ceAbstractionStarter]: For program point L20830(lines 20830 20834) no Hoare annotation was computed. [2018-12-09 01:08:46,529 INFO L448 ceAbstractionStarter]: For program point L20847-1(lines 20829 20901) no Hoare annotation was computed. [2018-12-09 01:08:46,529 INFO L448 ceAbstractionStarter]: For program point L20847(lines 20847 20898) no Hoare annotation was computed. [2018-12-09 01:08:46,529 INFO L444 ceAbstractionStarter]: At program point L20724(line 20724) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 main_~status~4) (= 0 ~customIrp~0) (= 0 ~s~0) (= 0 ~myStatus~0) (= 0 ~PagingReferenceCount~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,531 INFO L448 ceAbstractionStarter]: For program point L20724-1(line 20724) no Hoare annotation was computed. [2018-12-09 01:08:46,531 INFO L448 ceAbstractionStarter]: For program point L20864(lines 20864 20868) no Hoare annotation was computed. [2018-12-09 01:08:46,531 INFO L444 ceAbstractionStarter]: At program point L20798(line 20798) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= main_~__cil_tmp14~23 1) (= 0 ~customIrp~0) (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~26.base) (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~26.offset) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0))) [2018-12-09 01:08:46,531 INFO L448 ceAbstractionStarter]: For program point L20765(lines 20765 20815) no Hoare annotation was computed. [2018-12-09 01:08:46,531 INFO L448 ceAbstractionStarter]: For program point L20798-1(line 20798) no Hoare annotation was computed. [2018-12-09 01:08:46,531 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 20776 20811) no Hoare annotation was computed. [2018-12-09 01:08:46,531 INFO L444 ceAbstractionStarter]: At program point L20873(line 20873) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,532 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20692 20905) no Hoare annotation was computed. [2018-12-09 01:08:46,532 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 20776 20811) no Hoare annotation was computed. [2018-12-09 01:08:46,532 INFO L448 ceAbstractionStarter]: For program point L20881(lines 20881 20887) no Hoare annotation was computed. [2018-12-09 01:08:46,532 INFO L448 ceAbstractionStarter]: For program point L20749(line 20749) no Hoare annotation was computed. [2018-12-09 01:08:46,532 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 20692 20905) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,532 INFO L444 ceAbstractionStarter]: At program point L20766(lines 20765 20815) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= main_~__cil_tmp14~23 1) (< 0 (+ main_~status~4 1))) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,532 INFO L451 ceAbstractionStarter]: At program point L20775(lines 20774 20812) the Hoare annotation is: true [2018-12-09 01:08:46,532 INFO L444 ceAbstractionStarter]: At program point L20792(line 20792) the Hoare annotation is: (or (and (= |#funAddr~FloppyDeviceControl.offset| main_~__cil_tmp17~26.offset) (= |#funAddr~FloppyDeviceControl.base| main_~__cil_tmp17~26.base) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= main_~__cil_tmp14~23 1) (< 0 (+ main_~status~4 1))) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,539 INFO L448 ceAbstractionStarter]: For program point L20726(lines 20726 20828) no Hoare annotation was computed. [2018-12-09 01:08:46,539 INFO L448 ceAbstractionStarter]: For program point L20759(lines 20759 20817) no Hoare annotation was computed. [2018-12-09 01:08:46,539 INFO L448 ceAbstractionStarter]: For program point L20792-1(line 20792) no Hoare annotation was computed. [2018-12-09 01:08:46,539 INFO L448 ceAbstractionStarter]: For program point L20726-1(lines 20719 20904) no Hoare annotation was computed. [2018-12-09 01:08:46,539 INFO L448 ceAbstractionStarter]: For program point L20850(lines 20850 20894) no Hoare annotation was computed. [2018-12-09 01:08:46,539 INFO L444 ceAbstractionStarter]: At program point L20883(line 20883) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,539 INFO L444 ceAbstractionStarter]: At program point L20760(lines 20759 20817) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,539 INFO L448 ceAbstractionStarter]: For program point L20851(lines 20851 20891) no Hoare annotation was computed. [2018-12-09 01:08:46,539 INFO L448 ceAbstractionStarter]: For program point L20768(lines 20768 20814) no Hoare annotation was computed. [2018-12-09 01:08:46,539 INFO L444 ceAbstractionStarter]: At program point L20810(lines 20726 20826) the Hoare annotation is: (let ((.cse5 (= 1 ~setEventCalled~0)) (.cse7 (= main_~status~4 ~lowerDriverReturn~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (= ~s~0 4)) (.cse0 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~26.base)) (.cse1 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~26.offset)) (.cse2 (= 0 ~pended~0)) (.cse9 (= 2 ~s~0)) (.cse4 (= main_~__cil_tmp14~23 1)) (.cse6 (= 0 ~PagingReferenceCount~0)) (.cse10 (not (= 259 main_~status~4)))) (or (and .cse0 .cse1 .cse2 (= 6 ~s~0) (not .cse3) .cse4 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse7 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse6)) (and .cse3 .cse9 .cse10) (and (and .cse0 .cse1 .cse3 .cse4 .cse8) (= ~pended~0 1) (= 0 ~customIrp~0)) (and .cse7 .cse2 .cse3 .cse8) (not (= |old(~compRegistered~0)| 0)) (= 1 ~s~0) (not (= 0 |old(~pended~0)|)) (and (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse6) .cse10) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 01:08:46,539 INFO L448 ceAbstractionStarter]: For program point L20852(lines 20852 20860) no Hoare annotation was computed. [2018-12-09 01:08:46,539 INFO L444 ceAbstractionStarter]: At program point L20786(line 20786) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= |#funAddr~FloppyCreateClose.offset| main_~__cil_tmp16~26.offset)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,539 INFO L444 ceAbstractionStarter]: At program point L20769(lines 20768 20814) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= main_~status~4 0) (= main_~__cil_tmp14~23 1) (= 0 ~customIrp~0) (= 1 ~s~0) (= 0 ~PagingReferenceCount~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,545 INFO L444 ceAbstractionStarter]: At program point L20836(lines 20829 20901) the Hoare annotation is: (let ((.cse5 (= 1 ~setEventCalled~0)) (.cse7 (= main_~status~4 ~lowerDriverReturn~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (= ~s~0 4)) (.cse0 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~26.base)) (.cse1 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~26.offset)) (.cse2 (= 0 ~pended~0)) (.cse9 (= 2 ~s~0)) (.cse4 (= main_~__cil_tmp14~23 1)) (.cse6 (= 0 ~PagingReferenceCount~0)) (.cse10 (not (= 259 main_~status~4)))) (or (and .cse0 .cse1 .cse2 (= 6 ~s~0) (not .cse3) .cse4 .cse5 .cse6) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse7 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse6)) (and .cse3 .cse9 .cse10) (and (and .cse0 .cse1 .cse3 .cse4 .cse8) (= ~pended~0 1) (= 0 ~customIrp~0)) (and .cse7 .cse2 .cse3 .cse8) (= 0 ~s~0) (not (= |old(~compRegistered~0)| 0)) (= 1 ~s~0) (not (= 0 |old(~pended~0)|)) (and (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse6) .cse10) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 01:08:46,545 INFO L448 ceAbstractionStarter]: For program point L20753(lines 20753 20757) no Hoare annotation was computed. [2018-12-09 01:08:46,545 INFO L448 ceAbstractionStarter]: For program point L20786-1(line 20786) no Hoare annotation was computed. [2018-12-09 01:08:46,545 INFO L444 ceAbstractionStarter]: At program point L20844(lines 20837 20900) the Hoare annotation is: (let ((.cse5 (= 0 ~compRegistered~0)) (.cse2 (= |#funAddr~FloppyPnp.base| main_~__cil_tmp18~26.base)) (.cse3 (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~26.offset)) (.cse4 (= 0 ~pended~0)) (.cse6 (= main_~__cil_tmp14~23 1)) (.cse7 (= 1 ~setEventCalled~0)) (.cse11 (= ~s~0 4)) (.cse8 (= 0 ~PagingReferenceCount~0))) (let ((.cse0 (or (and .cse2 .cse3 .cse5 .cse6 .cse11) (and .cse4 .cse5 .cse6 .cse11) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse11 .cse8))) (.cse1 (= main_~status~4 ~lowerDriverReturn~0)) (.cse9 (= 2 ~s~0)) (.cse10 (not (= 259 main_~status~4)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 (= 6 ~s~0) (not .cse5) .cse6 .cse7 .cse8) (and .cse0 (= ~pended~0 1) (= 0 ~customIrp~0)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse5 .cse9 .cse10) (and .cse1 .cse4 .cse5 .cse11) (= 0 ~s~0) (not (= |old(~compRegistered~0)| 0)) (= 1 ~s~0) (not (= 0 |old(~pended~0)|)) (and (and .cse2 .cse3 .cse4 .cse9 .cse6 .cse8) .cse10) (not (= |old(~customIrp~0)| 0))))) [2018-12-09 01:08:46,545 INFO L448 ceAbstractionStarter]: For program point L20853(lines 20853 20857) no Hoare annotation was computed. [2018-12-09 01:08:46,545 INFO L448 ceAbstractionStarter]: For program point L20762(lines 20762 20816) no Hoare annotation was computed. [2018-12-09 01:08:46,545 INFO L448 ceAbstractionStarter]: For program point L20870(lines 20870 20889) no Hoare annotation was computed. [2018-12-09 01:08:46,545 INFO L444 ceAbstractionStarter]: At program point L20804(line 20804) the Hoare annotation is: (or (and (= |#funAddr~FloppyPower.base| main_~__cil_tmp19~28.base) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= |#funAddr~FloppyPower.offset| main_~__cil_tmp19~28.offset)) (not (= |old(~myStatus~0)| 0)) (not (= 0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 01:08:46,545 INFO L448 ceAbstractionStarter]: For program point L20771(lines 20771 20813) no Hoare annotation was computed. [2018-12-09 01:08:46,545 INFO L448 ceAbstractionStarter]: For program point L20804-1(line 20804) no Hoare annotation was computed. [2018-12-09 01:08:46,550 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedInsertTailListENTRY(lines 20974 20985) the Hoare annotation is: true [2018-12-09 01:08:46,550 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 20974 20985) no Hoare annotation was computed. [2018-12-09 01:08:46,550 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 20974 20985) no Hoare annotation was computed. [2018-12-09 01:08:46,550 INFO L444 ceAbstractionStarter]: At program point L21415(line 21415) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,550 INFO L448 ceAbstractionStarter]: For program point L21415-1(lines 21407 21420) no Hoare annotation was computed. [2018-12-09 01:08:46,550 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 21407 21420) the Hoare annotation is: (or (or (not (= ~setEventCalled~0 1)) (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (= ~s~0 |old(~s~0)|)) [2018-12-09 01:08:46,550 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 21407 21420) no Hoare annotation was computed. [2018-12-09 01:08:46,550 INFO L448 ceAbstractionStarter]: For program point RtlInitUnicodeStringFINAL(lines 21990 21997) no Hoare annotation was computed. [2018-12-09 01:08:46,550 INFO L451 ceAbstractionStarter]: At program point RtlInitUnicodeStringENTRY(lines 21990 21997) the Hoare annotation is: true [2018-12-09 01:08:46,550 INFO L448 ceAbstractionStarter]: For program point RtlInitUnicodeStringEXIT(lines 21990 21997) no Hoare annotation was computed. [2018-12-09 01:08:46,551 INFO L451 ceAbstractionStarter]: At program point PoStartNextPowerIrpENTRY(lines 21840 21846) the Hoare annotation is: true [2018-12-09 01:08:46,551 INFO L448 ceAbstractionStarter]: For program point PoStartNextPowerIrpFINAL(lines 21840 21846) no Hoare annotation was computed. [2018-12-09 01:08:46,551 INFO L448 ceAbstractionStarter]: For program point PoStartNextPowerIrpEXIT(lines 21840 21846) no Hoare annotation was computed. [2018-12-09 01:08:46,551 INFO L451 ceAbstractionStarter]: At program point L21864(lines 21863 21873) the Hoare annotation is: true [2018-12-09 01:08:46,551 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 21854 21876) no Hoare annotation was computed. [2018-12-09 01:08:46,551 INFO L451 ceAbstractionStarter]: At program point L21861(lines 21860 21874) the Hoare annotation is: true [2018-12-09 01:08:46,551 INFO L448 ceAbstractionStarter]: For program point L21860(lines 21860 21874) no Hoare annotation was computed. [2018-12-09 01:08:46,551 INFO L448 ceAbstractionStarter]: For program point L21871(lines 21854 21876) no Hoare annotation was computed. [2018-12-09 01:08:46,551 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21865 21872) no Hoare annotation was computed. [2018-12-09 01:08:46,551 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 21854 21876) the Hoare annotation is: true [2018-12-09 01:08:46,551 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21865 21872) no Hoare annotation was computed. [2018-12-09 01:08:46,551 INFO L444 ceAbstractionStarter]: At program point L8318(line 8318) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,551 INFO L448 ceAbstractionStarter]: For program point L8128(lines 8128 8159) no Hoare annotation was computed. [2018-12-09 01:08:46,557 INFO L448 ceAbstractionStarter]: For program point L8318-1(line 8318) no Hoare annotation was computed. [2018-12-09 01:08:46,557 INFO L448 ceAbstractionStarter]: For program point L8112-1(lines 8112 8334) no Hoare annotation was computed. [2018-12-09 01:08:46,557 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 7710 8345) no Hoare annotation was computed. [2018-12-09 01:08:46,557 INFO L448 ceAbstractionStarter]: For program point L8112(lines 8112 8334) no Hoare annotation was computed. [2018-12-09 01:08:46,557 INFO L448 ceAbstractionStarter]: For program point L8170(lines 8170 8187) no Hoare annotation was computed. [2018-12-09 01:08:46,557 INFO L444 ceAbstractionStarter]: At program point L7980(lines 7975 7981) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,557 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 7710 8345) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,558 INFO L448 ceAbstractionStarter]: For program point L8170-2(lines 8170 8187) no Hoare annotation was computed. [2018-12-09 01:08:46,558 INFO L448 ceAbstractionStarter]: For program point L8195-1(lines 8195 8199) no Hoare annotation was computed. [2018-12-09 01:08:46,558 INFO L448 ceAbstractionStarter]: For program point L8195(lines 8195 8199) no Hoare annotation was computed. [2018-12-09 01:08:46,558 INFO L444 ceAbstractionStarter]: At program point L8220loopEntry(lines 8220 8223) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (<= FloppyStartDevice_~ntStatus~4 0)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,558 INFO L444 ceAbstractionStarter]: At program point L8022(line 8022) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,558 INFO L448 ceAbstractionStarter]: For program point L8080-2(lines 8080 8092) no Hoare annotation was computed. [2018-12-09 01:08:46,558 INFO L448 ceAbstractionStarter]: For program point L8080(lines 8080 8092) no Hoare annotation was computed. [2018-12-09 01:08:46,558 INFO L448 ceAbstractionStarter]: For program point L8138(lines 8138 8155) no Hoare annotation was computed. [2018-12-09 01:08:46,558 INFO L444 ceAbstractionStarter]: At program point L8130(line 8130) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,558 INFO L444 ceAbstractionStarter]: At program point L8163(lines 8123 8236) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,558 INFO L444 ceAbstractionStarter]: At program point L7973(lines 7944 8344) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L8130-1(line 8130) no Hoare annotation was computed. [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L8015(lines 8015 8028) no Hoare annotation was computed. [2018-12-09 01:08:46,565 INFO L444 ceAbstractionStarter]: At program point L7966(lines 7944 8344) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L8123(lines 8123 8236) no Hoare annotation was computed. [2018-12-09 01:08:46,565 INFO L444 ceAbstractionStarter]: At program point L8214(lines 8214 8216) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L8247(lines 8247 8283) no Hoare annotation was computed. [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L8214-1(lines 8214 8216) no Hoare annotation was computed. [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L8247-2(lines 8247 8283) no Hoare annotation was computed. [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L8305-1(line 8305) no Hoare annotation was computed. [2018-12-09 01:08:46,565 INFO L444 ceAbstractionStarter]: At program point L8305(line 8305) the Hoare annotation is: (or (and (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (not (= FloppyStartDevice_~ntStatus~4 259))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,565 INFO L444 ceAbstractionStarter]: At program point L8008-1(line 8008) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,565 INFO L444 ceAbstractionStarter]: At program point L8008(line 8008) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L8297-1(lines 8297 8298) no Hoare annotation was computed. [2018-12-09 01:08:46,565 INFO L444 ceAbstractionStarter]: At program point L8297(lines 8297 8298) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,565 INFO L448 ceAbstractionStarter]: For program point L7984-1(line 7984) no Hoare annotation was computed. [2018-12-09 01:08:46,573 INFO L444 ceAbstractionStarter]: At program point L7984(line 7984) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,573 INFO L444 ceAbstractionStarter]: At program point L8017(line 8017) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,573 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 7710 8345) no Hoare annotation was computed. [2018-12-09 01:08:46,573 INFO L448 ceAbstractionStarter]: For program point L8009(line 8009) no Hoare annotation was computed. [2018-12-09 01:08:46,573 INFO L444 ceAbstractionStarter]: At program point L8191-2(lines 8191 8233) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (not (= 6 |old(~s~0)|)) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0) (= ~PagingReferenceCount~0 1)))) (or (and .cse0 (not (= FloppyStartDevice_~ntStatus~4 259))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 FloppyStartDevice_~InterfaceType~0) .cse0))) [2018-12-09 01:08:46,573 INFO L448 ceAbstractionStarter]: For program point L8192(line 8192) no Hoare annotation was computed. [2018-12-09 01:08:46,573 INFO L448 ceAbstractionStarter]: For program point L8341-1(line 8341) no Hoare annotation was computed. [2018-12-09 01:08:46,573 INFO L444 ceAbstractionStarter]: At program point L8341(line 8341) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,573 INFO L444 ceAbstractionStarter]: At program point L8110(line 8110) the Hoare annotation is: (or (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,573 INFO L444 ceAbstractionStarter]: At program point L8234(lines 8112 8332) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,573 INFO L448 ceAbstractionStarter]: For program point L8300-2(lines 8300 8309) no Hoare annotation was computed. [2018-12-09 01:08:46,573 INFO L448 ceAbstractionStarter]: For program point L8300(lines 8300 8309) no Hoare annotation was computed. [2018-12-09 01:08:46,574 INFO L448 ceAbstractionStarter]: For program point L8110-1(line 8110) no Hoare annotation was computed. [2018-12-09 01:08:46,574 INFO L444 ceAbstractionStarter]: At program point L7962loopEntry(lines 7962 7965) the Hoare annotation is: (or (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= ~PagingReferenceCount~0 1))) [2018-12-09 01:08:46,581 INFO L448 ceAbstractionStarter]: For program point L8218(lines 8218 8229) no Hoare annotation was computed. [2018-12-09 01:08:46,581 INFO L444 ceAbstractionStarter]: At program point L8086(lines 8086 8087) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (<= FloppyStartDevice_~ntStatus~4 259)) (.cse2 (= 0 ~customIrp~0)) (.cse3 (< 258 FloppyStartDevice_~ntStatus~4)) (.cse4 (not (= 0 ~compRegistered~0))) (.cse5 (= 1 ~setEventCalled~0)) (.cse6 (= ~PagingReferenceCount~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 1 ~s~0) .cse5 .cse6) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and .cse0 .cse1 .cse2 .cse3 (= 6 ~s~0) .cse4 .cse5 .cse6))) [2018-12-09 01:08:46,581 INFO L448 ceAbstractionStarter]: For program point L8020-1(lines 8015 8028) no Hoare annotation was computed. [2018-12-09 01:08:46,581 INFO L448 ceAbstractionStarter]: For program point L8020(lines 8020 8027) no Hoare annotation was computed. [2018-12-09 01:08:46,581 INFO L448 ceAbstractionStarter]: For program point L8086-1(lines 8086 8087) no Hoare annotation was computed. [2018-12-09 01:08:46,581 INFO L444 ceAbstractionStarter]: At program point L8078(line 8078) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~customIrp~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1)) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,581 INFO L448 ceAbstractionStarter]: For program point L8078-1(line 8078) no Hoare annotation was computed. [2018-12-09 01:08:46,581 INFO L444 ceAbstractionStarter]: At program point L8326(line 8326) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,581 INFO L444 ceAbstractionStarter]: At program point L8326-1(line 8326) the Hoare annotation is: (or (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (not (= 0 ~compRegistered~0)) (= 1 ~s~0) (= ~PagingReferenceCount~0 1))) (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 01:08:46,582 INFO L451 ceAbstractionStarter]: At program point ExFreePoolENTRY(lines 20949 20955) the Hoare annotation is: true [2018-12-09 01:08:46,582 INFO L448 ceAbstractionStarter]: For program point ExFreePoolFINAL(lines 20949 20955) no Hoare annotation was computed. [2018-12-09 01:08:46,582 INFO L448 ceAbstractionStarter]: For program point ExFreePoolEXIT(lines 20949 20955) no Hoare annotation was computed. [2018-12-09 01:08:46,582 INFO L448 ceAbstractionStarter]: For program point L21746(lines 21730 21751) no Hoare annotation was computed. [2018-12-09 01:08:46,582 INFO L448 ceAbstractionStarter]: For program point L21735(lines 21735 21749) no Hoare annotation was computed. [2018-12-09 01:08:46,582 INFO L451 ceAbstractionStarter]: At program point L21736(lines 21735 21749) the Hoare annotation is: true [2018-12-09 01:08:46,582 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 21730 21751) no Hoare annotation was computed. [2018-12-09 01:08:46,589 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 21730 21751) the Hoare annotation is: true [2018-12-09 01:08:46,589 INFO L451 ceAbstractionStarter]: At program point L21739(lines 21738 21748) the Hoare annotation is: true [2018-12-09 01:08:46,589 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21740 21747) no Hoare annotation was computed. [2018-12-09 01:08:46,589 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21740 21747) no Hoare annotation was computed. [2018-12-09 01:08:46,589 INFO L451 ceAbstractionStarter]: At program point L21139(line 21139) the Hoare annotation is: true [2018-12-09 01:08:46,589 INFO L448 ceAbstractionStarter]: For program point L21139-1(line 21139) no Hoare annotation was computed. [2018-12-09 01:08:46,589 INFO L448 ceAbstractionStarter]: For program point L21151(lines 21118 21156) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 21118 21156) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 ~s~0))) (not (= |old(~customIrp~0)| 0))) (= 0 ~customIrp~0)) [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 21118 21156) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L451 ceAbstractionStarter]: At program point L21134(lines 21133 21153) the Hoare annotation is: true [2018-12-09 01:08:46,590 INFO L451 ceAbstractionStarter]: At program point L21131(lines 21130 21154) the Hoare annotation is: true [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21135 21152) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point L21130(lines 21130 21154) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21135 21152) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 21590 21597) the Hoare annotation is: true [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 21590 21597) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 21590 21597) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 20678 20691) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 20678 20691) the Hoare annotation is: (or (or (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= ~PagingReferenceCount~0 0)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 20678 20691) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2559 2774) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point L2744(lines 2744 2753) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L451 ceAbstractionStarter]: At program point DriverEntryENTRY(lines 2559 2774) the Hoare annotation is: true [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point L2744-2(lines 2744 2753) no Hoare annotation was computed. [2018-12-09 01:08:46,590 INFO L448 ceAbstractionStarter]: For program point L2709-1(line 2709) no Hoare annotation was computed. [2018-12-09 01:08:46,598 INFO L444 ceAbstractionStarter]: At program point L2709(line 2709) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (= 0 DriverEntry_~ntStatus~0) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-09 01:08:46,598 INFO L448 ceAbstractionStarter]: For program point L2716(lines 2716 2720) no Hoare annotation was computed. [2018-12-09 01:08:46,598 INFO L444 ceAbstractionStarter]: At program point L2650(lines 2645 2651) the Hoare annotation is: (or (= 0 DriverEntry_~ntStatus~0) (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-09 01:08:46,598 INFO L448 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2559 2774) no Hoare annotation was computed. [2018-12-09 01:08:46,598 INFO L444 ceAbstractionStarter]: At program point L2646loopEntry(lines 2646 2649) the Hoare annotation is: (or (= 0 DriverEntry_~ntStatus~0) (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-09 01:08:46,598 INFO L448 ceAbstractionStarter]: For program point L2735-1(line 2735) no Hoare annotation was computed. [2018-12-09 01:08:46,598 INFO L444 ceAbstractionStarter]: At program point L2735(line 2735) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (= 0 DriverEntry_~ntStatus~0) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-09 01:08:46,598 INFO L448 ceAbstractionStarter]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2018-12-09 01:08:46,598 INFO L444 ceAbstractionStarter]: At program point L2733(line 2733) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (= 0 ~s~0)) (not (= ~compRegistered~0 0)) (= 0 DriverEntry_~ntStatus~0) (not (= 0 ~pended~0)) (not (= ~PagingReferenceCount~0 0)) (not (= ~customIrp~0 0))) [2018-12-09 01:08:46,598 INFO L448 ceAbstractionStarter]: For program point L2762(lines 2762 2770) no Hoare annotation was computed. [2018-12-09 01:08:46,598 INFO L448 ceAbstractionStarter]: For program point L2762-2(lines 2762 2770) no Hoare annotation was computed. [2018-12-09 01:08:46,598 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,599 INFO L451 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,599 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,599 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,599 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,599 INFO L448 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceEXIT(lines 21400 21406) no Hoare annotation was computed. [2018-12-09 01:08:46,599 INFO L451 ceAbstractionStarter]: At program point IoSetHardErrorOrVerifyDeviceENTRY(lines 21400 21406) the Hoare annotation is: true [2018-12-09 01:08:46,599 INFO L448 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceFINAL(lines 21400 21406) no Hoare annotation was computed. [2018-12-09 01:08:46,599 INFO L448 ceAbstractionStarter]: For program point L19380(lines 19380 19471) no Hoare annotation was computed. [2018-12-09 01:08:46,599 INFO L448 ceAbstractionStarter]: For program point L19285(line 19285) no Hoare annotation was computed. [2018-12-09 01:08:46,599 INFO L448 ceAbstractionStarter]: For program point L19335(lines 19335 19477) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19310(lines 19310 19314) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19405(lines 19405 19467) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19434(lines 19434 19456) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19352(lines 19352 19475) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19393(lines 19393 19469) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19427(lines 19427 19458) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19448(lines 19448 19452) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19415(lines 19415 19464) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19415-2(lines 19415 19464) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 19162 19480) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19295-1(lines 19295 19318) no Hoare annotation was computed. [2018-12-09 01:08:46,606 INFO L448 ceAbstractionStarter]: For program point L19295(lines 19295 19318) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L451 ceAbstractionStarter]: At program point L19324(lines 19283 19325) the Hoare annotation is: true [2018-12-09 01:08:46,607 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 19162 19480) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L451 ceAbstractionStarter]: At program point L19284-2(lines 19284 19323) the Hoare annotation is: true [2018-12-09 01:08:46,607 INFO L448 ceAbstractionStarter]: For program point L19420(lines 19420 19460) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L448 ceAbstractionStarter]: For program point L19367(lines 19367 19473) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 19162 19480) the Hoare annotation is: true [2018-12-09 01:08:46,607 INFO L448 ceAbstractionStarter]: For program point L19441(lines 19441 19454) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L448 ceAbstractionStarter]: For program point IoDetachDeviceEXIT(lines 21248 21254) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L448 ceAbstractionStarter]: For program point IoDetachDeviceFINAL(lines 21248 21254) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L451 ceAbstractionStarter]: At program point IoDetachDeviceENTRY(lines 21248 21254) the Hoare annotation is: true [2018-12-09 01:08:46,607 INFO L448 ceAbstractionStarter]: For program point L19766(lines 19766 19779) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L444 ceAbstractionStarter]: At program point L19764(line 19764) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (= 1 ~s~0)) [2018-12-09 01:08:46,607 INFO L448 ceAbstractionStarter]: For program point L19766-2(lines 19766 19779) no Hoare annotation was computed. [2018-12-09 01:08:46,607 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 19685 19782) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-09 01:08:46,612 INFO L448 ceAbstractionStarter]: For program point L19764-1(line 19764) no Hoare annotation was computed. [2018-12-09 01:08:46,612 INFO L444 ceAbstractionStarter]: At program point L19772(line 19772) the Hoare annotation is: (let ((.cse0 (= 259 FlFdcDeviceIo_~ntStatus~16)) (.cse1 (= 1 ~setEventCalled~0))) (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= 6 ~s~0) .cse1) (and .cse0 (= 1 ~s~0) .cse1))) [2018-12-09 01:08:46,613 INFO L448 ceAbstractionStarter]: For program point L19772-1(line 19772) no Hoare annotation was computed. [2018-12-09 01:08:46,613 INFO L448 ceAbstractionStarter]: For program point L19729-1(lines 19729 19730) no Hoare annotation was computed. [2018-12-09 01:08:46,613 INFO L444 ceAbstractionStarter]: At program point L19729(lines 19729 19730) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-09 01:08:46,613 INFO L448 ceAbstractionStarter]: For program point L19736(lines 19736 19747) no Hoare annotation was computed. [2018-12-09 01:08:46,613 INFO L444 ceAbstractionStarter]: At program point L19742(lines 19737 19743) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 01:08:46,613 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 19685 19782) no Hoare annotation was computed. [2018-12-09 01:08:46,613 INFO L444 ceAbstractionStarter]: At program point L19738loopEntry(lines 19738 19741) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0)))) [2018-12-09 01:08:46,613 INFO L444 ceAbstractionStarter]: At program point L19718loopEntry(lines 19718 19721) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-09 01:08:46,613 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 19685 19782) no Hoare annotation was computed. [2018-12-09 01:08:46,613 INFO L444 ceAbstractionStarter]: At program point L19726(line 19726) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-09 01:08:46,613 INFO L448 ceAbstractionStarter]: For program point L19726-1(line 19726) no Hoare annotation was computed. [2018-12-09 01:08:46,613 INFO L444 ceAbstractionStarter]: At program point L19722(lines 19717 19723) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (not (= 0 ~pended~0)) (= ~compRegistered~0 0) (not (= 1 |old(~s~0)|))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0))) [2018-12-09 01:08:46,613 INFO L448 ceAbstractionStarter]: For program point L21334(lines 21306 21339) no Hoare annotation was computed. [2018-12-09 01:08:46,613 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 21306 21339) no Hoare annotation was computed. [2018-12-09 01:08:46,613 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 21306 21339) the Hoare annotation is: true [2018-12-09 01:08:46,617 INFO L451 ceAbstractionStarter]: At program point L21327(lines 21326 21336) the Hoare annotation is: true [2018-12-09 01:08:46,617 INFO L448 ceAbstractionStarter]: For program point L21323(lines 21323 21337) no Hoare annotation was computed. [2018-12-09 01:08:46,617 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21328 21335) no Hoare annotation was computed. [2018-12-09 01:08:46,617 INFO L451 ceAbstractionStarter]: At program point L21324(lines 21323 21337) the Hoare annotation is: true [2018-12-09 01:08:46,617 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21328 21335) no Hoare annotation was computed. [2018-12-09 01:08:46,617 INFO L448 ceAbstractionStarter]: For program point L21241(lines 21226 21246) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L451 ceAbstractionStarter]: At program point L21234(lines 21233 21243) the Hoare annotation is: true [2018-12-09 01:08:46,618 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 21226 21246) the Hoare annotation is: true [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 21226 21246) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L451 ceAbstractionStarter]: At program point L21231(lines 21230 21244) the Hoare annotation is: true [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point L21230(lines 21230 21244) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21235 21242) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21235 21242) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4280 4285) the Hoare annotation is: true [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point L4282(line 4282) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4280 4285) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4282) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point L4281-2(lines 4280 4285) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point L4281(lines 4281 4283) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point MmResetDriverPagingFINAL(lines 21709 21715) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point MmResetDriverPagingEXIT(lines 21709 21715) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L451 ceAbstractionStarter]: At program point MmResetDriverPagingENTRY(lines 21709 21715) the Hoare annotation is: true [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 21344 21367) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point L21362(lines 21344 21367) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 21344 21367) the Hoare annotation is: true [2018-12-09 01:08:46,618 INFO L448 ceAbstractionStarter]: For program point L21351(lines 21351 21365) no Hoare annotation was computed. [2018-12-09 01:08:46,618 INFO L451 ceAbstractionStarter]: At program point L21352(lines 21351 21365) the Hoare annotation is: true [2018-12-09 01:08:46,623 INFO L451 ceAbstractionStarter]: At program point L21355(lines 21354 21364) the Hoare annotation is: true [2018-12-09 01:08:46,623 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21356 21363) no Hoare annotation was computed. [2018-12-09 01:08:46,623 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21356 21363) no Hoare annotation was computed. [2018-12-09 01:08:46,623 INFO L451 ceAbstractionStarter]: At program point L21383(lines 21382 21396) the Hoare annotation is: true [2018-12-09 01:08:46,623 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 21378 21398) no Hoare annotation was computed. [2018-12-09 01:08:46,623 INFO L448 ceAbstractionStarter]: For program point L21382(lines 21382 21396) no Hoare annotation was computed. [2018-12-09 01:08:46,623 INFO L448 ceAbstractionStarter]: For program point L21393(lines 21378 21398) no Hoare annotation was computed. [2018-12-09 01:08:46,623 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 21378 21398) the Hoare annotation is: true [2018-12-09 01:08:46,623 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21387 21394) no Hoare annotation was computed. [2018-12-09 01:08:46,623 INFO L451 ceAbstractionStarter]: At program point L21386(lines 21385 21395) the Hoare annotation is: true [2018-12-09 01:08:46,623 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21387 21394) no Hoare annotation was computed. [2018-12-09 01:08:46,623 INFO L451 ceAbstractionStarter]: At program point L8855(line 8855) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L448 ceAbstractionStarter]: For program point L8855-1(line 8855) no Hoare annotation was computed. [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L9037(lines 9032 9038) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L448 ceAbstractionStarter]: For program point L8988(lines 8988 9021) no Hoare annotation was computed. [2018-12-09 01:08:46,624 INFO L448 ceAbstractionStarter]: For program point L8988-1(lines 8822 9046) no Hoare annotation was computed. [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L8972(lines 8967 8973) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L448 ceAbstractionStarter]: For program point L8997(line 8997) no Hoare annotation was computed. [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L8824loopEntry(lines 8824 8827) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteEXIT(lines 8735 9047) no Hoare annotation was computed. [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L8965(lines 8958 8975) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L8990loopEntry(lines 8990 8993) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L9015(lines 9010 9016) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L8982(lines 8927 9024) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L8859(line 8859) the Hoare annotation is: true [2018-12-09 01:08:46,624 INFO L448 ceAbstractionStarter]: For program point L8859-1(line 8859) no Hoare annotation was computed. [2018-12-09 01:08:46,624 INFO L448 ceAbstractionStarter]: For program point L8958(lines 8958 8977) no Hoare annotation was computed. [2018-12-09 01:08:46,624 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteFINAL(lines 8735 9047) no Hoare annotation was computed. [2018-12-09 01:08:46,624 INFO L451 ceAbstractionStarter]: At program point L9033loopEntry(lines 9033 9036) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point FloppyReadWriteENTRY(lines 8735 9047) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8893(lines 8893 8897) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8893-2(lines 8893 8897) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point L8959(lines 8944 8979) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L9026(lines 9026 9044) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point L8828(lines 8823 8829) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L9018(line 9018) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8927(lines 8927 9024) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8853(lines 8853 8864) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8886(lines 8886 8916) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8944(lines 8944 8979) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point L8911(line 8911) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8878(lines 8878 8918) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8911-1(line 8911) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point L8994(lines 8989 8995) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point L9011loopEntry(lines 9011 9014) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point L8887(lines 8878 8918) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8846-1(line 8846) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point L8846(line 8846) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point L8871(line 8871) the Hoare annotation is: true [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point L8871-1(line 8871) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L448 ceAbstractionStarter]: For program point ObfDereferenceObjectFINAL(lines 21753 21759) no Hoare annotation was computed. [2018-12-09 01:08:46,628 INFO L451 ceAbstractionStarter]: At program point ObfDereferenceObjectENTRY(lines 21753 21759) the Hoare annotation is: true [2018-12-09 01:08:46,629 INFO L448 ceAbstractionStarter]: For program point ObfDereferenceObjectEXIT(lines 21753 21759) no Hoare annotation was computed. [2018-12-09 01:08:46,629 INFO L448 ceAbstractionStarter]: For program point KeInitializeEventEXIT(lines 21554 21560) no Hoare annotation was computed. [2018-12-09 01:08:46,629 INFO L451 ceAbstractionStarter]: At program point KeInitializeEventENTRY(lines 21554 21560) the Hoare annotation is: true [2018-12-09 01:08:46,629 INFO L448 ceAbstractionStarter]: For program point KeInitializeEventFINAL(lines 21554 21560) no Hoare annotation was computed. [2018-12-09 01:08:46,629 INFO L444 ceAbstractionStarter]: At program point L4701(line 4701) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point L4701-1(line 4701) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 4673 4705) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L444 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 4673 4705) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,635 INFO L444 ceAbstractionStarter]: At program point L4688(lines 4683 4689) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,635 INFO L444 ceAbstractionStarter]: At program point L4684loopEntry(lines 4684 4687) the Hoare annotation is: (or (= 1 ~s~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 4673 4705) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 21762 21838) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point L21820(lines 21820 21826) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L451 ceAbstractionStarter]: At program point L21775(line 21775) the Hoare annotation is: true [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point L21775-1(line 21775) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 21762 21838) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point L21780(lines 21780 21786) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L451 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 21762 21838) the Hoare annotation is: true [2018-12-09 01:08:46,635 INFO L451 ceAbstractionStarter]: At program point L21792(lines 21791 21814) the Hoare annotation is: true [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point L21772-1(lines 21771 21837) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point L21772(lines 21772 21790) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L451 ceAbstractionStarter]: At program point L21810(lines 21771 21837) the Hoare annotation is: true [2018-12-09 01:08:46,635 INFO L451 ceAbstractionStarter]: At program point L21798(lines 21797 21812) the Hoare annotation is: true [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point L21794(lines 21794 21813) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 21799 21811) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 21799 21811) no Hoare annotation was computed. [2018-12-09 01:08:46,635 INFO L451 ceAbstractionStarter]: At program point L21782(line 21782) the Hoare annotation is: true [2018-12-09 01:08:46,636 INFO L448 ceAbstractionStarter]: For program point L21819(lines 21819 21834) no Hoare annotation was computed. [2018-12-09 01:08:46,636 INFO L451 ceAbstractionStarter]: At program point L21795(lines 21794 21813) the Hoare annotation is: true [2018-12-09 01:08:46,636 INFO L448 ceAbstractionStarter]: For program point L21828-2(lines 21815 21835) no Hoare annotation was computed. [2018-12-09 01:08:46,636 INFO L448 ceAbstractionStarter]: For program point L21828(lines 21828 21833) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 20988 20998) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedRemoveHeadListENTRY(lines 20988 20998) the Hoare annotation is: true [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 20988 20998) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L451 ceAbstractionStarter]: At program point L8475(lines 8470 8476) the Hoare annotation is: true [2018-12-09 01:08:46,642 INFO L451 ceAbstractionStarter]: At program point L8698(line 8698) the Hoare annotation is: true [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point L8698-1(lines 8694 8700) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L451 ceAbstractionStarter]: At program point L8599(line 8599) the Hoare annotation is: true [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point L8599-1(line 8599) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point FloppyPowerEXIT(lines 8357 8734) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point L8525(lines 8525 8537) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point L8525-2(lines 8525 8537) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point L8550(lines 8550 8581) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point L8509(lines 8509 8688) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L451 ceAbstractionStarter]: At program point L8658(lines 8658 8659) the Hoare annotation is: true [2018-12-09 01:08:46,642 INFO L448 ceAbstractionStarter]: For program point L8658-1(lines 8658 8659) no Hoare annotation was computed. [2018-12-09 01:08:46,642 INFO L451 ceAbstractionStarter]: At program point L8609(lines 8604 8610) the Hoare annotation is: true [2018-12-09 01:08:46,642 INFO L451 ceAbstractionStarter]: At program point L8576(line 8576) the Hoare annotation is: true [2018-12-09 01:08:46,643 INFO L451 ceAbstractionStarter]: At program point L8543(line 8543) the Hoare annotation is: true [2018-12-09 01:08:46,643 INFO L448 ceAbstractionStarter]: For program point L8576-1(line 8576) no Hoare annotation was computed. [2018-12-09 01:08:46,643 INFO L451 ceAbstractionStarter]: At program point L8510(lines 8509 8688) the Hoare annotation is: true [2018-12-09 01:08:46,643 INFO L448 ceAbstractionStarter]: For program point L8543-1(line 8543) no Hoare annotation was computed. [2018-12-09 01:08:46,643 INFO L448 ceAbstractionStarter]: For program point L8692(lines 8467 8733) no Hoare annotation was computed. [2018-12-09 01:08:46,643 INFO L451 ceAbstractionStarter]: At program point L8618loopEntry(lines 8618 8621) the Hoare annotation is: true [2018-12-09 01:08:46,643 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 8514 8686) no Hoare annotation was computed. [2018-12-09 01:08:46,643 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 8514 8686) no Hoare annotation was computed. [2018-12-09 01:08:46,643 INFO L451 ceAbstractionStarter]: At program point L8635(line 8635) the Hoare annotation is: true [2018-12-09 01:08:46,643 INFO L448 ceAbstractionStarter]: For program point L8635-1(line 8635) no Hoare annotation was computed. [2018-12-09 01:08:46,643 INFO L448 ceAbstractionStarter]: For program point FloppyPowerFINAL(lines 8357 8734) no Hoare annotation was computed. [2018-12-09 01:08:46,643 INFO L448 ceAbstractionStarter]: For program point L8594(lines 8594 8671) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8685(lines 8512 8687) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8594-1(lines 8514 8684) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8528(lines 8528 8533) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8603(lines 8603 8629) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8562(lines 8557 8563) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8603-2(lines 8603 8629) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8471loopEntry(lines 8471 8474) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8587(line 8587) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8587-1(line 8587) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8645(lines 8645 8667) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8521(lines 8516 8522) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8678(lines 8673 8679) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point FloppyPowerENTRY(lines 8357 8734) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8555(line 8555) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8555-1(lines 8555 8561) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8605loopEntry(lines 8605 8608) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8506(lines 8506 8689) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8622(lines 8617 8623) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8507(lines 8506 8689) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L451 ceAbstractionStarter]: At program point L8730(line 8730) the Hoare annotation is: true [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8565(line 8565) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8730-1(line 8730) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point L8648(lines 8648 8663) no Hoare annotation was computed. [2018-12-09 01:08:46,650 INFO L448 ceAbstractionStarter]: For program point RtlFreeUnicodeStringFINAL(lines 21972 21978) no Hoare annotation was computed. [2018-12-09 01:08:46,651 INFO L448 ceAbstractionStarter]: For program point RtlFreeUnicodeStringEXIT(lines 21972 21978) no Hoare annotation was computed. [2018-12-09 01:08:46,651 INFO L451 ceAbstractionStarter]: At program point RtlFreeUnicodeStringENTRY(lines 21972 21978) the Hoare annotation is: true [2018-12-09 01:08:46,651 INFO L448 ceAbstractionStarter]: For program point L8352-1(line 8352) no Hoare annotation was computed. [2018-12-09 01:08:46,651 INFO L451 ceAbstractionStarter]: At program point L8352(line 8352) the Hoare annotation is: true [2018-12-09 01:08:46,651 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 8346 8356) the Hoare annotation is: true [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 8346 8356) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 8346 8356) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L444 ceAbstractionStarter]: At program point L21622(line 21622) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0))) (let ((.cse4 (not .cse3)) (.cse5 (not (= |old(~customIrp~0)| 0))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse6 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (= 6 |old(~s~0)|)) .cse2 .cse3) (or (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (or .cse4 .cse2 .cse6) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse6)))) [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point L21620-1(lines 21606 21644) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point L21620(lines 21620 21626) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 21602 21645) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L444 ceAbstractionStarter]: At program point L21630(lines 21629 21643) the Hoare annotation is: (let ((.cse10 (= ~compRegistered~0 0))) (let ((.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (not (= ~PagingReferenceCount~0 1))) (.cse5 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse2 (not .cse10)) (.cse9 (not (= 0 ~pended~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse1 (= 0 ~customIrp~0)) (.cse0 (= 1 ~s~0)) (.cse3 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= 1 ~pended~0)) (and .cse0 .cse1) .cse2 .cse3 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (let ((.cse6 (= 1 ~setEventCalled~0))) (or (and (not (= ~customIrp~0 1)) .cse5 .cse0 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse4) (and .cse1 (= 1 |old(~customIrp~0)|) .cse0 .cse6))) (or (or .cse7 .cse8 (not (= 6 |old(~s~0)|)) .cse9 .cse10) (and .cse5 .cse0)) (or (or .cse2 .cse9 .cse4) (and .cse1 .cse0) .cse3)))) [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 21634 21641) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point L21608(lines 21608 21613) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 21634 21641) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L444 ceAbstractionStarter]: At program point L21633(lines 21632 21642) the Hoare annotation is: (let ((.cse10 (= ~compRegistered~0 0))) (let ((.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (not (= ~PagingReferenceCount~0 1))) (.cse5 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse2 (not .cse10)) (.cse9 (not (= 0 ~pended~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse1 (= 0 ~customIrp~0)) (.cse0 (= 1 ~s~0)) (.cse3 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= 1 ~pended~0)) (and .cse0 .cse1) .cse2 .cse3 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (let ((.cse6 (= 1 ~setEventCalled~0))) (or (and (not (= ~customIrp~0 1)) .cse5 .cse0 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse4) (and .cse1 (= 1 |old(~customIrp~0)|) .cse0 .cse6))) (or (or .cse7 .cse8 (not (= 6 |old(~s~0)|)) .cse9 .cse10) (and .cse5 .cse0)) (or (or .cse2 .cse9 .cse4) (and .cse1 .cse0) .cse3)))) [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point L21607(lines 21607 21628) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L448 ceAbstractionStarter]: For program point L21640(lines 21602 21645) no Hoare annotation was computed. [2018-12-09 01:08:46,657 INFO L444 ceAbstractionStarter]: At program point L21615(lines 21607 21628) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0))) (let ((.cse5 (= 0 ~customIrp~0)) (.cse6 (not .cse3)) (.cse8 (not (= |old(~customIrp~0)| 0))) (.cse4 (= 1 ~s~0)) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse7 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (= 6 |old(~s~0)|)) .cse2 .cse3) (or (and .cse4 .cse5) (or .cse6 .cse2 .cse7) .cse8) (or (not (= 1 ~pended~0)) (and (= ~s~0 |old(~s~0)|) .cse5) .cse6 .cse8 .cse7 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (and (= ~customIrp~0 |old(~customIrp~0)|) .cse4 (= 1 ~setEventCalled~0)) (or .cse0 .cse1 .cse2 .cse3 .cse7))))) [2018-12-09 01:08:46,668 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 21602 21645) the Hoare annotation is: (let ((.cse9 (= ~s~0 |old(~s~0)|)) (.cse3 (= ~compRegistered~0 0))) (let ((.cse6 (= 0 ~customIrp~0)) (.cse7 (not .cse3)) (.cse8 (not (= |old(~customIrp~0)| 0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= ~PagingReferenceCount~0 1))) (.cse2 (not (= 0 ~pended~0))) (.cse5 (and (= ~customIrp~0 |old(~customIrp~0)|) .cse9 (= 1 ~setEventCalled~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4) .cse5) (or (and (= 1 ~s~0) .cse6) (or .cse7 .cse2 .cse4) .cse8) (or (and .cse9 .cse6) (not (= 1 ~pended~0)) .cse7 .cse8 .cse4 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (or (or .cse0 .cse1 (not (= 6 |old(~s~0)|)) .cse2 .cse3) .cse5)))) [2018-12-09 01:08:46,668 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 21580 21587) no Hoare annotation was computed. [2018-12-09 01:08:46,668 INFO L451 ceAbstractionStarter]: At program point KeReleaseSemaphoreENTRY(lines 21580 21587) the Hoare annotation is: true [2018-12-09 01:08:46,668 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 21580 21587) no Hoare annotation was computed. [2018-12-09 01:08:46,668 INFO L451 ceAbstractionStarter]: At program point L2784(lines 2779 2785) the Hoare annotation is: true [2018-12-09 01:08:46,668 INFO L451 ceAbstractionStarter]: At program point L2780loopEntry(lines 2780 2783) the Hoare annotation is: true [2018-12-09 01:08:46,668 INFO L451 ceAbstractionStarter]: At program point FloppyUnloadENTRY(lines 2775 2792) the Hoare annotation is: true [2018-12-09 01:08:46,668 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadEXIT(lines 2775 2792) no Hoare annotation was computed. [2018-12-09 01:08:46,668 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadFINAL(lines 2775 2792) no Hoare annotation was computed. [2018-12-09 01:08:46,668 INFO L451 ceAbstractionStarter]: At program point L2788(line 2788) the Hoare annotation is: true [2018-12-09 01:08:46,668 INFO L444 ceAbstractionStarter]: At program point L21513(line 21513) the Hoare annotation is: (let ((.cse0 (not (= 0 ~pended~0))) (.cse2 (not (= ~compRegistered~0 0))) (.cse1 (not (= 1 |old(~s~0)|)))) (and (or (not (= ~PagingReferenceCount~0 1)) .cse0 .cse1) (or .cse2 .cse0 .cse1) (or .cse2 .cse1 (= (mod ~PagingReferenceCount~0 4294967296) 0)))) [2018-12-09 01:08:46,668 INFO L448 ceAbstractionStarter]: For program point L21513-1(lines 21505 21518) no Hoare annotation was computed. [2018-12-09 01:08:46,668 INFO L448 ceAbstractionStarter]: For program point L21509(lines 21509 21515) no Hoare annotation was computed. [2018-12-09 01:08:46,669 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 21505 21518) 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-12-09 01:08:46,669 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 21505 21518) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 2106 2110) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 2106 2110) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 2106 2110) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point MmPageEntireDriverEXIT(lines 21701 21707) no Hoare annotation was computed. [2018-12-09 01:08:46,678 INFO L451 ceAbstractionStarter]: At program point MmPageEntireDriverENTRY(lines 21701 21707) the Hoare annotation is: true [2018-12-09 01:08:46,678 INFO L448 ceAbstractionStarter]: For program point MmPageEntireDriverFINAL(lines 21701 21707) no Hoare annotation was computed. [2018-12-09 01:08:46,679 INFO L451 ceAbstractionStarter]: At program point L21958(lines 21957 21967) the Hoare annotation is: true [2018-12-09 01:08:46,679 INFO L451 ceAbstractionStarter]: At program point L21955(lines 21954 21968) the Hoare annotation is: true [2018-12-09 01:08:46,679 INFO L448 ceAbstractionStarter]: For program point L21954(lines 21954 21968) no Hoare annotation was computed. [2018-12-09 01:08:46,679 INFO L448 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 21949 21970) no Hoare annotation was computed. [2018-12-09 01:08:46,679 INFO L451 ceAbstractionStarter]: At program point RtlDeleteRegistryValueENTRY(lines 21949 21970) the Hoare annotation is: true [2018-12-09 01:08:46,687 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 21959 21966) no Hoare annotation was computed. [2018-12-09 01:08:46,687 INFO L448 ceAbstractionStarter]: For program point L21965(lines 21949 21970) no Hoare annotation was computed. [2018-12-09 01:08:46,687 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 21959 21966) no Hoare annotation was computed. [2018-12-09 01:08:46,687 INFO L448 ceAbstractionStarter]: For program point mallocFINAL(lines 20907 20913) no Hoare annotation was computed. [2018-12-09 01:08:46,687 INFO L448 ceAbstractionStarter]: For program point mallocEXIT(lines 20907 20913) no Hoare annotation was computed. [2018-12-09 01:08:46,687 INFO L451 ceAbstractionStarter]: At program point mallocENTRY(lines 20907 20913) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point IoDeleteDeviceEXIT(lines 21218 21224) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point IoDeleteDeviceFINAL(lines 21218 21224) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point IoDeleteDeviceENTRY(lines 21218 21224) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point ExAcquireFastMutexEXIT(lines 20915 20921) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point ExAcquireFastMutexENTRY(lines 20915 20921) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point ExAcquireFastMutexFINAL(lines 20915 20921) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point L22009(lines 22009 22023) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 22003 22025) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point RtlQueryRegistryValuesENTRY(lines 22003 22025) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point L22010(lines 22009 22023) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L451 ceAbstractionStarter]: At program point L22013(lines 22012 22022) the Hoare annotation is: true [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point L22020(lines 22003 22025) no Hoare annotation was computed. [2018-12-09 01:08:46,688 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 22014 22021) no Hoare annotation was computed. [2018-12-09 01:08:46,695 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 22014 22021) no Hoare annotation was computed. [2018-12-09 01:08:46,695 INFO L448 ceAbstractionStarter]: For program point L21490(lines 21490 21497) no Hoare annotation was computed. [2018-12-09 01:08:46,696 INFO L444 ceAbstractionStarter]: At program point L21457(lines 21456 21475) the Hoare annotation is: (let ((.cse6 (= ~compRegistered~0 0))) (let ((.cse1 (not (= 0 ~pended~0))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse0 (not .cse6)) (.cse2 (not (= 3 |old(~s~0)|))) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse3 (not (= ~customIrp~0 0)))) (and (or (or .cse0 .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse0 .cse1 (= 3 ~s~0) .cse2) (or (or (or .cse1 .cse6 (not (= 1 |old(~s~0)|))) .cse5) (and (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5))) (or (not (= 1 ~pended~0)) .cse0 .cse2 .cse4 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-09 01:08:46,696 INFO L448 ceAbstractionStarter]: For program point L21482(lines 21482 21488) no Hoare annotation was computed. [2018-12-09 01:08:46,696 INFO L444 ceAbstractionStarter]: At program point L21495(line 21495) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0))) (let ((.cse2 (not (= ~PagingReferenceCount~0 1))) (.cse0 (not (= 0 ~pended~0))) (.cse3 (not .cse1)) (.cse4 (not (= 3 |old(~s~0)|))) (.cse5 (not (= ~customIrp~0 0)))) (and (or (or .cse0 .cse1 (not (= 1 |old(~s~0)|))) .cse2) (or (or .cse3 .cse0 .cse4) .cse5) (or .cse2 .cse3 .cse0 .cse4) (or (not (= 1 ~pended~0)) .cse3 .cse4 .cse5 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-09 01:08:46,696 INFO L448 ceAbstractionStarter]: For program point L21495-1(lines 21477 21499) no Hoare annotation was computed. [2018-12-09 01:08:46,696 INFO L444 ceAbstractionStarter]: At program point L21437(line 21437) the Hoare annotation is: (let ((.cse4 (= ~compRegistered~0 0))) (let ((.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse0 (not .cse4)) (.cse2 (not (= 3 |old(~s~0)|))) (.cse3 (not (= ~customIrp~0 0)))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or (= 1 ~s~0) (or (or .cse1 .cse4 (not (= 1 |old(~s~0)|))) .cse5)) (or .cse5 .cse0 .cse1 .cse2) (or (not (= 1 ~pended~0)) .cse0 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-09 01:08:46,696 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 21423 21502) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0))) (let ((.cse2 (not (= ~PagingReferenceCount~0 1))) (.cse0 (not (= 0 ~pended~0))) (.cse3 (not .cse1)) (.cse4 (not (= 3 |old(~s~0)|))) (.cse6 (= ~s~0 |old(~s~0)|)) (.cse5 (not (= ~customIrp~0 0)))) (and (or (= 1 ~s~0) (or (or .cse0 .cse1 (not (= 1 |old(~s~0)|))) .cse2)) (or (or .cse3 .cse0 .cse4) .cse5 .cse6) (or .cse2 .cse3 .cse0 (= 3 ~s~0) .cse4) (or (not (= 1 ~pended~0)) .cse3 .cse4 .cse6 .cse5 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-09 01:08:46,696 INFO L448 ceAbstractionStarter]: For program point L21437-1(line 21437) no Hoare annotation was computed. [2018-12-09 01:08:46,696 INFO L448 ceAbstractionStarter]: For program point L21442(lines 21442 21448) no Hoare annotation was computed. [2018-12-09 01:08:46,696 INFO L444 ceAbstractionStarter]: At program point L21454(lines 21453 21476) the Hoare annotation is: (let ((.cse6 (= ~compRegistered~0 0))) (let ((.cse1 (not (= 0 ~pended~0))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse0 (not .cse6)) (.cse2 (not (= 3 |old(~s~0)|))) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse3 (not (= ~customIrp~0 0)))) (and (or (or .cse0 .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse0 .cse1 (= 3 ~s~0) .cse2) (or (or (or .cse1 .cse6 (not (= 1 |old(~s~0)|))) .cse5) (and (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5))) (or (not (= 1 ~pended~0)) .cse0 .cse2 .cse4 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-09 01:08:46,704 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 21423 21502) no Hoare annotation was computed. [2018-12-09 01:08:46,704 INFO L448 ceAbstractionStarter]: For program point L21434-1(lines 21433 21501) no Hoare annotation was computed. [2018-12-09 01:08:46,704 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 21423 21502) no Hoare annotation was computed. [2018-12-09 01:08:46,704 INFO L448 ceAbstractionStarter]: For program point L21434(lines 21434 21452) no Hoare annotation was computed. [2018-12-09 01:08:46,704 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 21461 21473) no Hoare annotation was computed. [2018-12-09 01:08:46,704 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 21461 21473) no Hoare annotation was computed. [2018-12-09 01:08:46,705 INFO L444 ceAbstractionStarter]: At program point L21460(lines 21459 21474) the Hoare annotation is: (let ((.cse6 (= ~compRegistered~0 0))) (let ((.cse1 (not (= 0 ~pended~0))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse0 (not .cse6)) (.cse2 (not (= 3 |old(~s~0)|))) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse3 (not (= ~customIrp~0 0)))) (and (or (or .cse0 .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse0 .cse1 (= 3 ~s~0) .cse2) (or (or (or .cse1 .cse6 (not (= 1 |old(~s~0)|))) .cse5) (and (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802)) (= 1 ~setEventCalled~0) (= ~s~0 5))) (or (not (= 1 ~pended~0)) .cse0 .cse2 .cse4 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-09 01:08:46,705 INFO L444 ceAbstractionStarter]: At program point L21472(lines 21433 21501) the Hoare annotation is: (let ((.cse8 (= ~compRegistered~0 0))) (let ((.cse9 (not (= ~PagingReferenceCount~0 1))) (.cse2 (= 3 ~s~0)) (.cse0 (not .cse8)) (.cse7 (not (= 0 ~pended~0))) (.cse1 (not (= 3 |old(~s~0)|))) (.cse3 (not (= ~customIrp~0 0)))) (and (or (not (= 1 ~pended~0)) .cse0 .cse1 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0)) (let ((.cse4 (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802))) (.cse5 (= 1 ~setEventCalled~0)) (.cse6 (= ~s~0 5))) (or (and .cse4 .cse5 (= IofCallDriver_~returnVal2~0 259) .cse6) (or (or .cse7 .cse8 (not (= 1 |old(~s~0)|))) .cse9) (and .cse4 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse5 .cse6) (and .cse4 (= 0 IofCallDriver_~returnVal2~0) .cse5 .cse6))) (or (= ~s~0 |old(~s~0)|) .cse9 .cse0 .cse7 .cse1) (or .cse2 (or .cse0 .cse7 .cse1) .cse3)))) [2018-12-09 01:08:46,705 INFO L448 ceAbstractionStarter]: For program point L21481(lines 21481 21498) no Hoare annotation was computed. [2018-12-09 01:08:46,705 INFO L444 ceAbstractionStarter]: At program point L21444(line 21444) the Hoare annotation is: (let ((.cse4 (= ~compRegistered~0 0))) (let ((.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse1 (not (= 0 ~pended~0))) (.cse0 (not .cse4)) (.cse2 (not (= 3 |old(~s~0)|))) (.cse3 (not (= ~customIrp~0 0)))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or (or (or .cse1 .cse4 (not (= 1 |old(~s~0)|))) .cse5) (and (= 0 (+ IofCallDriver_~__cil_tmp9~25 1073741802)) (= 1 ~s~0) (= 1 ~setEventCalled~0))) (or .cse5 .cse0 .cse1 .cse2) (or (not (= 1 ~pended~0)) .cse0 .cse2 .cse3 (= (mod ~PagingReferenceCount~0 4294967296) 0))))) [2018-12-09 01:08:46,705 INFO L448 ceAbstractionStarter]: For program point L21456(lines 21456 21475) no Hoare annotation was computed. [2018-12-09 01:08:46,718 INFO L448 ceAbstractionStarter]: For program point L4606(lines 4606 4610) no Hoare annotation was computed. [2018-12-09 01:08:46,718 INFO L448 ceAbstractionStarter]: For program point L4668-1(line 4668) no Hoare annotation was computed. [2018-12-09 01:08:46,718 INFO L444 ceAbstractionStarter]: At program point L4602(line 4602) 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-12-09 01:08:46,718 INFO L444 ceAbstractionStarter]: At program point L4668(line 4668) the Hoare annotation is: (or (and (= ~pended~0 1) (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-12-09 01:08:46,718 INFO L448 ceAbstractionStarter]: For program point L4503(lines 4503 4619) no Hoare annotation was computed. [2018-12-09 01:08:46,719 INFO L448 ceAbstractionStarter]: For program point L4664-1(line 4664) no Hoare annotation was computed. [2018-12-09 01:08:46,719 INFO L444 ceAbstractionStarter]: At program point L4598(line 4598) 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-12-09 01:08:46,719 INFO L448 ceAbstractionStarter]: For program point L4602-1(line 4602) no Hoare annotation was computed. [2018-12-09 01:08:46,719 INFO L444 ceAbstractionStarter]: At program point L4664(line 4664) the Hoare annotation is: (or (and (= ~pended~0 1) (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-12-09 01:08:46,719 INFO L444 ceAbstractionStarter]: At program point L4594(lines 4594 4595) 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-12-09 01:08:46,719 INFO L448 ceAbstractionStarter]: For program point L4598-1(line 4598) no Hoare annotation was computed. [2018-12-09 01:08:46,719 INFO L448 ceAbstractionStarter]: For program point L4594-1(lines 4594 4595) no Hoare annotation was computed. [2018-12-09 01:08:46,719 INFO L444 ceAbstractionStarter]: At program point L4454(lines 4449 4455) 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-12-09 01:08:46,719 INFO L444 ceAbstractionStarter]: At program point L4516-1(lines 4516 4523) 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-12-09 01:08:46,719 INFO L444 ceAbstractionStarter]: At program point L4549(lines 4549 4550) 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-12-09 01:08:46,719 INFO L448 ceAbstractionStarter]: For program point L4516(lines 4516 4523) no Hoare annotation was computed. [2018-12-09 01:08:46,719 INFO L448 ceAbstractionStarter]: For program point L4549-1(lines 4549 4550) no Hoare annotation was computed. [2018-12-09 01:08:46,732 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 4286 4672) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4475(line 4475) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,733 INFO L448 ceAbstractionStarter]: For program point L4442(lines 4442 4469) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4475-1(lines 4475 4481) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4566(line 4566) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (= 0 ~pended~0) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4434(line 4434) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,733 INFO L448 ceAbstractionStarter]: For program point L4566-1(line 4566) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L448 ceAbstractionStarter]: For program point L4434-1(line 4434) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L448 ceAbstractionStarter]: For program point L4554(lines 4554 4581) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L448 ceAbstractionStarter]: For program point L4525(line 4525) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L448 ceAbstractionStarter]: For program point L4488-1(line 4488) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4649(line 4649) 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-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4488(line 4488) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,733 INFO L448 ceAbstractionStarter]: For program point L4649-1(lines 4645 4651) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L448 ceAbstractionStarter]: For program point L4645(lines 4645 4651) no Hoare annotation was computed. [2018-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4447(line 4447) 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-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4447-1(lines 4447 4453) 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-12-09 01:08:46,733 INFO L444 ceAbstractionStarter]: At program point L4513(line 4513) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point L4513-1(line 4513) no Hoare annotation was computed. [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point L4563(lines 4563 4570) no Hoare annotation was computed. [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 4286 4672) no Hoare annotation was computed. [2018-12-09 01:08:46,749 INFO L444 ceAbstractionStarter]: At program point L4563-2(lines 4563 4570) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (= 0 ~pended~0) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,749 INFO L444 ceAbstractionStarter]: At program point L4617(line 4617) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point L4617-1(lines 4503 4619) no Hoare annotation was computed. [2018-12-09 01:08:46,749 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 4286 4672) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point L4576-1(line 4576) no Hoare annotation was computed. [2018-12-09 01:08:46,749 INFO L444 ceAbstractionStarter]: At program point L4576(line 4576) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (= 0 ~pended~0) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point L4572(line 4572) no Hoare annotation was computed. [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point L4560-1(line 4560) no Hoare annotation was computed. [2018-12-09 01:08:46,749 INFO L444 ceAbstractionStarter]: At program point L4560(line 4560) 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-12-09 01:08:46,749 INFO L444 ceAbstractionStarter]: At program point L4519(line 4519) 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-12-09 01:08:46,749 INFO L444 ceAbstractionStarter]: At program point L4482(lines 4477 4483) the Hoare annotation is: (or (not (= |old(~PagingReferenceCount~0)| 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~PagingReferenceCount~0 1)) (not (= ~customIrp~0 0)) (not (= 1 ~s~0))) [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point L6444(lines 6444 6464) no Hoare annotation was computed. [2018-12-09 01:08:46,749 INFO L451 ceAbstractionStarter]: At program point L6345loopEntry(lines 6345 6348) the Hoare annotation is: true [2018-12-09 01:08:46,749 INFO L451 ceAbstractionStarter]: At program point L5487loopEntry(lines 5487 5490) the Hoare annotation is: true [2018-12-09 01:08:46,749 INFO L448 ceAbstractionStarter]: For program point L6214(lines 6214 6223) no Hoare annotation was computed. [2018-12-09 01:08:46,759 INFO L448 ceAbstractionStarter]: For program point L6148-1(lines 6148 6150) no Hoare annotation was computed. [2018-12-09 01:08:46,759 INFO L451 ceAbstractionStarter]: At program point L6082(lines 6082 6083) the Hoare annotation is: true [2018-12-09 01:08:46,759 INFO L451 ceAbstractionStarter]: At program point L6148(lines 6148 6150) the Hoare annotation is: true [2018-12-09 01:08:46,759 INFO L448 ceAbstractionStarter]: For program point L6082-1(lines 6082 6083) no Hoare annotation was computed. [2018-12-09 01:08:46,759 INFO L451 ceAbstractionStarter]: At program point L5554(line 5554) the Hoare annotation is: true [2018-12-09 01:08:46,759 INFO L448 ceAbstractionStarter]: For program point L5455(lines 5455 6422) no Hoare annotation was computed. [2018-12-09 01:08:46,759 INFO L451 ceAbstractionStarter]: At program point L5554-1(line 5554) the Hoare annotation is: true [2018-12-09 01:08:46,759 INFO L448 ceAbstractionStarter]: For program point L5323(lines 5323 5350) no Hoare annotation was computed. [2018-12-09 01:08:46,759 INFO L448 ceAbstractionStarter]: For program point L5389(lines 5389 5431) no Hoare annotation was computed. [2018-12-09 01:08:46,759 INFO L451 ceAbstractionStarter]: At program point L6413(lines 5292 6485) the Hoare annotation is: true [2018-12-09 01:08:46,759 INFO L448 ceAbstractionStarter]: For program point L5323-2(lines 5323 5350) no Hoare annotation was computed. [2018-12-09 01:08:46,759 INFO L451 ceAbstractionStarter]: At program point L6050(lines 6045 6051) the Hoare annotation is: true [2018-12-09 01:08:46,759 INFO L451 ceAbstractionStarter]: At program point L5918(lines 5913 5919) the Hoare annotation is: true [2018-12-09 01:08:46,759 INFO L451 ceAbstractionStarter]: At program point L5852(lines 5467 6418) the Hoare annotation is: true [2018-12-09 01:08:46,759 INFO L448 ceAbstractionStarter]: For program point L5687(lines 5687 5699) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L448 ceAbstractionStarter]: For program point L5555(line 5555) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L448 ceAbstractionStarter]: For program point L5621(lines 5621 5631) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L448 ceAbstractionStarter]: For program point L5390(lines 5390 5396) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L448 ceAbstractionStarter]: For program point L6447(lines 6447 6463) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L451 ceAbstractionStarter]: At program point L6282(line 6282) the Hoare annotation is: true [2018-12-09 01:08:46,760 INFO L451 ceAbstractionStarter]: At program point L5357(line 5357) the Hoare annotation is: true [2018-12-09 01:08:46,760 INFO L448 ceAbstractionStarter]: For program point L5357-1(line 5357) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L448 ceAbstractionStarter]: For program point L6282-1(line 6282) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L448 ceAbstractionStarter]: For program point L5787(lines 5787 5804) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L451 ceAbstractionStarter]: At program point L5820(lines 5455 6422) the Hoare annotation is: true [2018-12-09 01:08:46,760 INFO L451 ceAbstractionStarter]: At program point L6316(lines 5473 6416) the Hoare annotation is: true [2018-12-09 01:08:46,760 INFO L451 ceAbstractionStarter]: At program point L6349(lines 6344 6350) the Hoare annotation is: true [2018-12-09 01:08:46,760 INFO L448 ceAbstractionStarter]: For program point L6184(lines 6184 6227) no Hoare annotation was computed. [2018-12-09 01:08:46,760 INFO L451 ceAbstractionStarter]: At program point L5689loopEntry(lines 5689 5692) the Hoare annotation is: true [2018-12-09 01:08:46,760 INFO L451 ceAbstractionStarter]: At program point L5491(lines 5486 5492) the Hoare annotation is: true [2018-12-09 01:08:46,774 INFO L448 ceAbstractionStarter]: For program point L5458(lines 5458 6421) no Hoare annotation was computed. [2018-12-09 01:08:46,774 INFO L448 ceAbstractionStarter]: For program point L6284-1(line 6284) no Hoare annotation was computed. [2018-12-09 01:08:46,774 INFO L451 ceAbstractionStarter]: At program point L6218(line 6218) the Hoare annotation is: true [2018-12-09 01:08:46,774 INFO L451 ceAbstractionStarter]: At program point L6284(line 6284) the Hoare annotation is: true [2018-12-09 01:08:46,774 INFO L448 ceAbstractionStarter]: For program point L6086(lines 6086 6091) no Hoare annotation was computed. [2018-12-09 01:08:46,774 INFO L448 ceAbstractionStarter]: For program point L6450(lines 6450 6462) no Hoare annotation was computed. [2018-12-09 01:08:46,774 INFO L451 ceAbstractionStarter]: At program point L5426(line 5426) the Hoare annotation is: true [2018-12-09 01:08:46,774 INFO L451 ceAbstractionStarter]: At program point L5294loopEntry(lines 5294 5297) the Hoare annotation is: true [2018-12-09 01:08:46,774 INFO L448 ceAbstractionStarter]: For program point L5426-1(line 5426) no Hoare annotation was computed. [2018-12-09 01:08:46,774 INFO L448 ceAbstractionStarter]: For program point L5889(lines 5889 5901) no Hoare annotation was computed. [2018-12-09 01:08:46,774 INFO L448 ceAbstractionStarter]: For program point L5526(lines 5526 5536) no Hoare annotation was computed. [2018-12-09 01:08:46,774 INFO L448 ceAbstractionStarter]: For program point L5592(lines 5592 5597) no Hoare annotation was computed. [2018-12-09 01:08:46,774 INFO L451 ceAbstractionStarter]: At program point L5394(line 5394) the Hoare annotation is: true [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point L5394-1(lines 5390 5396) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point L6154(lines 6154 6162) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point L5461(lines 5461 6420) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L451 ceAbstractionStarter]: At program point L6188(line 6188) the Hoare annotation is: true [2018-12-09 01:08:46,775 INFO L451 ceAbstractionStarter]: At program point L5891loopEntry(lines 5891 5894) the Hoare annotation is: true [2018-12-09 01:08:46,775 INFO L451 ceAbstractionStarter]: At program point L5693(lines 5688 5694) the Hoare annotation is: true [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point L6453(lines 6453 6461) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L451 ceAbstractionStarter]: At program point L5859loopEntry(lines 5859 5862) the Hoare annotation is: true [2018-12-09 01:08:46,775 INFO L451 ceAbstractionStarter]: At program point L5298(lines 5293 5299) the Hoare annotation is: true [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point L5364(lines 5364 5381) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 4706 6486) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point L6058(lines 6058 6063) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L451 ceAbstractionStarter]: At program point L6157(line 6157) the Hoare annotation is: true [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point L5464(lines 5464 6419) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L451 ceAbstractionStarter]: At program point L5828(lines 5458 6421) the Hoare annotation is: true [2018-12-09 01:08:46,775 INFO L448 ceAbstractionStarter]: For program point L6456-2(lines 6437 6474) no Hoare annotation was computed. [2018-12-09 01:08:46,775 INFO L451 ceAbstractionStarter]: At program point L5465(lines 5464 6419) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L6126(line 6126) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L6126-1(line 6126) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L5895(lines 5890 5896) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L5499(lines 5499 5504) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L6358loopEntry(lines 6358 6361) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L6292-1(line 6292) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L6292(line 6292) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L5863(lines 5858 5864) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L5797(lines 5797 5802) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L5467(lines 5467 6418) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L5335(lines 5335 5346) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L6293(line 6293) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L6095(line 6095) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L6095-1(line 6095) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L5337(line 5337) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L5337-1(line 5337) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L5470(lines 5470 6417) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L6362(lines 6357 6363) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L6263(lines 6263 6277) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L6329(lines 6329 6370) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L5735(lines 5735 5810) no Hoare annotation was computed. [2018-12-09 01:08:46,792 INFO L451 ceAbstractionStarter]: At program point L5471(lines 5470 6417) the Hoare annotation is: true [2018-12-09 01:08:46,792 INFO L448 ceAbstractionStarter]: For program point L6429(lines 6429 6483) no Hoare annotation was computed. [2018-12-09 01:08:46,793 INFO L451 ceAbstractionStarter]: At program point L6331loopEntry(lines 6331 6334) the Hoare annotation is: true [2018-12-09 01:08:46,793 INFO L448 ceAbstractionStarter]: For program point L6199(lines 6199 6225) no Hoare annotation was computed. [2018-12-09 01:08:46,793 INFO L451 ceAbstractionStarter]: At program point L5836loopEntry(lines 5836 5839) the Hoare annotation is: true [2018-12-09 01:08:46,793 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 4706 6486) no Hoare annotation was computed. [2018-12-09 01:08:46,793 INFO L451 ceAbstractionStarter]: At program point L5671(lines 5449 6424) the Hoare annotation is: true [2018-12-09 01:08:46,793 INFO L448 ceAbstractionStarter]: For program point L5473(lines 5473 6416) no Hoare annotation was computed. [2018-12-09 01:08:46,807 INFO L448 ceAbstractionStarter]: For program point L5440(lines 5440 6427) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L5341(line 5341) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L5341-1(line 5341) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L6365(line 6365) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L5441(lines 5440 6427) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L5574(lines 5569 5575) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L5376-1(line 5376) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L5376(line 5376) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L6169(lines 6169 6229) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L5707(line 5707) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L5707-1(line 5707) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L5443(lines 5443 6426) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L6335(lines 6330 6336) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L6203(line 6203) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L6071(lines 6071 6076) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L6005loopEntry(lines 6005 6008) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L5939-2(lines 5939 6026) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L5840(lines 5835 5841) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point $Ultimate##43(lines 5478 6414) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point $Ultimate##42(lines 5478 6414) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L5444(lines 5443 6426) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L5940(line 5940) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L5709(lines 5709 5721) no Hoare annotation was computed. [2018-12-09 01:08:46,808 INFO L451 ceAbstractionStarter]: At program point L6469(line 6469) the Hoare annotation is: true [2018-12-09 01:08:46,808 INFO L448 ceAbstractionStarter]: For program point L5446(lines 5446 6425) no Hoare annotation was computed. [2018-12-09 01:08:46,809 INFO L451 ceAbstractionStarter]: At program point L6437-1(lines 6437 6476) the Hoare annotation is: true [2018-12-09 01:08:46,809 INFO L448 ceAbstractionStarter]: For program point L6437(lines 6437 6476) no Hoare annotation was computed. [2018-12-09 01:08:46,809 INFO L451 ceAbstractionStarter]: At program point L6272(line 6272) the Hoare annotation is: true [2018-12-09 01:08:46,809 INFO L451 ceAbstractionStarter]: At program point L6173(line 6173) the Hoare annotation is: true [2018-12-09 01:08:46,809 INFO L448 ceAbstractionStarter]: For program point L5843(line 5843) no Hoare annotation was computed. [2018-12-09 01:08:46,823 INFO L451 ceAbstractionStarter]: At program point L5711loopEntry(lines 5711 5714) the Hoare annotation is: true [2018-12-09 01:08:46,823 INFO L448 ceAbstractionStarter]: For program point L5777(lines 5777 5806) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L5744(lines 5744 5749) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L5447(lines 5446 6425) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L6438(lines 6438 6466) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L6372(lines 5476 6415) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L6108-1(line 6108) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L6108(line 6108) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L6009(lines 6004 6010) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L5316-1(line 5316) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L5316(line 5316) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L6109(line 6109) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L5812(lines 5452 6423) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 4706 6486) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L5449(lines 5449 6424) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L6044(lines 6044 6314) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L5912-2(lines 5912 5930) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L5945(lines 5945 5949) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L5912(lines 5912 5930) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L5945-1(lines 5945 5949) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L5582(lines 5582 5599) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L6441(lines 6441 6465) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L5715(lines 5710 5716) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L5649(line 5649) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L5649-1(line 5649) the Hoare annotation is: true [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L6343(lines 6343 6355) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L448 ceAbstractionStarter]: For program point L6409-1(line 6409) no Hoare annotation was computed. [2018-12-09 01:08:46,824 INFO L451 ceAbstractionStarter]: At program point L6409(line 6409) the Hoare annotation is: true [2018-12-09 01:08:46,825 INFO L451 ceAbstractionStarter]: At program point L6046loopEntry(lines 6046 6049) the Hoare annotation is: true [2018-12-09 01:08:46,825 INFO L451 ceAbstractionStarter]: At program point L5914loopEntry(lines 5914 5917) the Hoare annotation is: true [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point L5650(line 5650) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point L5452(lines 5452 6423) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point L6377-1(lines 6373 6379) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L451 ceAbstractionStarter]: At program point L6377(line 6377) the Hoare annotation is: true [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point ExReleaseFastMutexFINAL(lines 20923 20929) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L451 ceAbstractionStarter]: At program point ExReleaseFastMutexENTRY(lines 20923 20929) the Hoare annotation is: true [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point ExReleaseFastMutexEXIT(lines 20923 20929) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0)) [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 9 14) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L451 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 9 14) the Hoare annotation is: true [2018-12-09 01:08:46,841 INFO L448 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 9 14) no Hoare annotation was computed. [2018-12-09 01:08:46,841 INFO L451 ceAbstractionStarter]: At program point L20210(line 20210) the Hoare annotation is: true [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20156(line 20156) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20210-1(lines 20206 20212) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20206(lines 20206 20212) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L451 ceAbstractionStarter]: At program point L20107(line 20107) the Hoare annotation is: true [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 20027 20234) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20104(lines 20104 20111) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L451 ceAbstractionStarter]: At program point L20104-1(lines 20104 20111) the Hoare annotation is: true [2018-12-09 01:08:46,842 INFO L451 ceAbstractionStarter]: At program point L20162(line 20162) the Hoare annotation is: true [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20129-1(lines 20129 20229) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20129(lines 20129 20229) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20162-1(line 20162) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20138-1(line 20138) no Hoare annotation was computed. [2018-12-09 01:08:46,842 INFO L448 ceAbstractionStarter]: For program point L20101-1(line 20101) no Hoare annotation was computed. [2018-12-09 01:08:46,857 INFO L451 ceAbstractionStarter]: At program point L20101(line 20101) the Hoare annotation is: true [2018-12-09 01:08:46,857 INFO L448 ceAbstractionStarter]: For program point L20113(line 20113) no Hoare annotation was computed. [2018-12-09 01:08:46,857 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 20027 20234) no Hoare annotation was computed. [2018-12-09 01:08:46,857 INFO L448 ceAbstractionStarter]: For program point L20142(lines 20142 20173) no Hoare annotation was computed. [2018-12-09 01:08:46,857 INFO L451 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 20027 20234) the Hoare annotation is: true [2018-12-09 01:08:46,857 INFO L451 ceAbstractionStarter]: At program point L20138(line 20138) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point L20122-1(line 20122) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point L20225-1(line 20225) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L20225(line 20225) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point L20159(lines 20159 20166) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L20159-2(lines 20159 20166) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L20122(line 20122) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L20155-1(line 20155) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L20155(line 20155) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point L20168(line 20168) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L20176(lines 20129 20229) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 20933 20947) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 20933 20947) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 20933 20947) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L20942(line 20942) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point L20942-1(line 20942) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L4096(lines 4095 4139) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point L4082(lines 4082 4086) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 3936 4279) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L4111(lines 4110 4134) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point L4107(lines 4107 4135) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L4105(lines 4104 4136) the Hoare annotation is: true [2018-12-09 01:08:46,858 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 4112 4133) no Hoare annotation was computed. [2018-12-09 01:08:46,858 INFO L451 ceAbstractionStarter]: At program point L4132(lines 4112 4133) the Hoare annotation is: true [2018-12-09 01:08:46,870 INFO L448 ceAbstractionStarter]: For program point L4101(lines 4101 4137) no Hoare annotation was computed. [2018-12-09 01:08:46,870 INFO L448 ceAbstractionStarter]: For program point $Ultimate##13(lines 4112 4133) no Hoare annotation was computed. [2018-12-09 01:08:46,870 INFO L451 ceAbstractionStarter]: At program point L4099(lines 4098 4138) the Hoare annotation is: true [2018-12-09 01:08:46,870 INFO L448 ceAbstractionStarter]: For program point L4095(lines 4095 4139) no Hoare annotation was computed. [2018-12-09 01:08:46,870 INFO L451 ceAbstractionStarter]: At program point L4108(lines 4107 4135) the Hoare annotation is: true [2018-12-09 01:08:46,870 INFO L448 ceAbstractionStarter]: For program point L4104(lines 4104 4136) no Hoare annotation was computed. [2018-12-09 01:08:46,870 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 3936 4279) the Hoare annotation is: true [2018-12-09 01:08:46,871 INFO L451 ceAbstractionStarter]: At program point L4102(lines 4101 4137) the Hoare annotation is: true [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 3936 4279) no Hoare annotation was computed. [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point L4098(lines 4098 4138) no Hoare annotation was computed. [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,871 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~s~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= 0 ~customIrp~0) (= 0 ~PagingReferenceCount~0)) [2018-12-09 01:08:46,871 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:08:46,871 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 22027 22047) the Hoare annotation is: true [2018-12-09 01:08:46,871 INFO L451 ceAbstractionStarter]: At program point L22035(lines 22034 22044) the Hoare annotation is: true [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point L22042(lines 22027 22047) no Hoare annotation was computed. [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 22027 22047) no Hoare annotation was computed. [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point L22031(lines 22031 22045) no Hoare annotation was computed. [2018-12-09 01:08:46,871 INFO L451 ceAbstractionStarter]: At program point L22032(lines 22031 22045) the Hoare annotation is: true [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 22036 22043) no Hoare annotation was computed. [2018-12-09 01:08:46,871 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 22036 22043) no Hoare annotation was computed. [2018-12-09 01:08:46,877 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,878 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,878 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,879 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,879 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,881 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,881 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,881 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,882 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,882 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,882 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,882 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,886 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,886 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,886 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,886 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,886 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,894 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,895 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,895 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,895 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,895 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,902 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,902 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,902 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,902 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,903 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,914 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,914 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,914 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,914 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,916 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,916 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,928 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,929 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,929 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,929 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,929 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,930 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,930 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,930 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,930 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,930 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,931 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,931 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,931 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,931 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,931 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,934 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,934 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,935 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,935 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,935 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,935 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,935 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,936 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,936 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,939 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,940 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,940 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,940 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,940 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,941 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:46,941 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:46,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:08:46 BoogieIcfgContainer [2018-12-09 01:08:46,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:08:46,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:08:46,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:08:46,945 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:08:46,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:05:04" (3/4) ... [2018-12-09 01:08:46,950 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 01:08:46,957 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoGetConfigurationInformation [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedInsertTailList [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlInitUnicodeString [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoStartNextPowerIrp [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExFreePool [2018-12-09 01:08:46,958 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DriverEntry [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetHardErrorOrVerifyDevice [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDetachDevice [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure MmResetDriverPaging [2018-12-09 01:08:46,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyReadWrite [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObfDereferenceObject [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeInitializeEvent [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedRemoveHeadList [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPower [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlFreeUnicodeString [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeReleaseSemaphore [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyUnload [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-09 01:08:46,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedExchange [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure MmPageEntireDriver [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlDeleteRegistryValue [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteDevice [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-12-09 01:08:46,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAcquireFastMutex [2018-12-09 01:08:46,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlQueryRegistryValues [2018-12-09 01:08:46,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-09 01:08:46,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-12-09 01:08:46,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-12-09 01:08:46,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExReleaseFastMutex [2018-12-09 01:08:46,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 01:08:46,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_guard [2018-12-09 01:08:46,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-12-09 01:08:46,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-12-09 01:08:46,964 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-12-09 01:08:46,965 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-09 01:08:47,014 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 646 nodes and edges [2018-12-09 01:08:47,021 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 313 nodes and edges [2018-12-09 01:08:47,027 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 147 nodes and edges [2018-12-09 01:08:47,032 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2018-12-09 01:08:47,036 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-12-09 01:08:47,039 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 01:08:47,042 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 01:08:47,045 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 01:08:47,048 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 01:08:47,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (status == lowerDriverReturn && (((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && pended == 1) && 0 == customIrp)) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || 0 == s) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 2 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) || (((0 == pended && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4)) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && status == lowerDriverReturn) || (((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || ((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) || (((0 == pended && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4)) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && pended == 1) && 0 == customIrp)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || 0 == s) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 2 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (status == lowerDriverReturn && ((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && !(6 == s)) && !(0 == compRegistered)) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && !(259 == status)) && 0 == PagingReferenceCount)) || ((((0 == pended && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0))) || (((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)))) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((pended == 1 && 0 == customIrp) && ((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && !(6 == s)) && !(0 == compRegistered)) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && !(259 == status)) && 0 == PagingReferenceCount)) || ((((0 == pended && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0))) || (((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 2 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(1 == pended) || (1 == s && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) && (((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled))) && (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) || (customIrp == \old(customIrp) && 1 == s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (0 == customIrp && 1 == s)) || !(\old(customIrp) == 0)) [2018-12-09 01:08:47,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(1 == pended) || (1 == s && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) && (((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled))) && (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) || (customIrp == \old(customIrp) && 1 == s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (0 == customIrp && 1 == s)) || !(\old(customIrp) == 0)) [2018-12-09 01:08:47,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s)) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-12-09 01:08:47,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) [2018-12-09 01:08:47,074 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 == compRegistered && pended == 1) && 0 == customIrp) && !(PagingReferenceCount % 4294967296 == 0)) && s == 4)) || (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && 2 == s)) || ((((0 == pended && 6 == s) && !(0 == compRegistered)) && 1 == setEventCalled) && PagingReferenceCount == 1)) || (((0 == pended && 2 == s) && PagingReferenceCount == 1) && !(259 == ntStatus))) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && PagingReferenceCount == 1) && s == 4)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && 0 == customIrp) && s == 4)) || (((0 == compRegistered && !(ntStatus == 259)) && 2 == s) && !(PagingReferenceCount % 4294967296 == 0)) [2018-12-09 01:08:47,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || 3 == s) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) && ((((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && returnVal2 == 259) && s == 5) || ((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || (((0 == __cil_tmp9 + 1073741802 && returnVal2 + 1073741823 <= 0) && 1 == setEventCalled) && s == 5)) || (((0 == __cil_tmp9 + 1073741802 && 0 == returnVal2) && 1 == setEventCalled) && s == 5))) && ((((s == \old(s) || !(PagingReferenceCount == 1)) || !(compRegistered == 0)) || !(0 == pended)) || !(3 == \old(s)))) && ((3 == s || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) [2018-12-09 01:08:47,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s)) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-12-09 01:08:47,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s)) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) [2018-12-09 01:08:47,075 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,075 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || 0 == myStatus) || !(\old(customIrp) == 0)) && ((((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || ((((0 == pended && customIrp == \old(customIrp)) && !(0 == compRegistered)) && s == \old(s)) && PagingReferenceCount == 1))) && ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || (((0 == pended && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1)) || !(1 == \old(s)))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s))) [2018-12-09 01:08:47,075 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,076 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == myStatus || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || !(\old(customIrp) == 0)) && ((((((((0 == pended && customIrp == \old(customIrp)) && __cil_tmp17 == 0) && headOfList == 0) && !(0 == compRegistered)) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1) || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s)))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s)))) && ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((((((0 == pended && 0 == compRegistered) && __cil_tmp17 == 0) && headOfList == 0) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1)) || !(1 == \old(s))) [2018-12-09 01:08:47,076 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == pended && 0 == compRegistered) && 1 == s) && __cil_tmp14 == 1) && 0 < status + 1) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,077 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 == pended && 0 == compRegistered) && status == 0) && __cil_tmp14 == 1) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,077 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,078 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-12-09 01:08:47,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && PagingReferenceCount == 1)) || !(customIrp == 0)) || !(1 == s) [2018-12-09 01:08:47,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (status == lowerDriverReturn && (((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && pended == 1) && 0 == customIrp)) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 2 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,078 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-12-09 01:08:47,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && PagingReferenceCount == 1)) || !(customIrp == 0)) || !(1 == s) [2018-12-09 01:08:47,079 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) [2018-12-09 01:08:47,080 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) [2018-12-09 01:08:47,080 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) && (((1 == s && 0 == customIrp) || (!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || !(\old(customIrp) == 0))) && (((((!(1 == pended) || (s == \old(s) && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0)) && (((customIrp == \old(customIrp) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) [2018-12-09 01:08:47,089 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-09 01:08:47,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) && !(ntStatus == 259)) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (0 == InterfaceType && ((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) [2018-12-09 01:08:47,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-09 01:08:47,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ntStatus == 259) && ((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-09 01:08:47,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-09 01:08:47,091 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-12-09 01:08:47,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) [2018-12-09 01:08:47,092 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) [2018-12-09 01:08:47,092 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-09 01:08:47,105 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) [2018-12-09 01:08:47,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-09 01:08:47,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) [2018-12-09 01:08:47,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-09 01:08:47,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-09 01:08:47,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: s == \old(s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,107 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) [2018-12-09 01:08:47,107 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: s == \old(s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) [2018-12-09 01:08:47,107 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-12-09 01:08:47,107 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-12-09 01:08:47,108 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-12-09 01:08:47,124 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) [2018-12-09 01:08:47,125 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) [2018-12-09 01:08:47,125 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) [2018-12-09 01:08:47,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || (s == \old(s) && 0 == customIrp) [2018-12-09 01:08:47,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || (s == \old(s) && 0 == customIrp) [2018-12-09 01:08:47,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) && ntStatus <= 0) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) [2018-12-09 01:08:47,134 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) [2018-12-09 01:08:47,134 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) [2018-12-09 01:08:47,134 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) [2018-12-09 01:08:47,134 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) [2018-12-09 01:08:47,136 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) [2018-12-09 01:08:47,136 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) [2018-12-09 01:08:47,366 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c199dbe5-e11a-4f78-b9b2-9403eb94d7f5/bin-2019/uautomizer/witness.graphml [2018-12-09 01:08:47,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:08:47,366 INFO L168 Benchmark]: Toolchain (without parser) took 236275.82 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 934.5 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-09 01:08:47,367 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:08:47,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2115.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 934.5 MB in the beginning and 1.2 GB in the end (delta: -268.6 MB). Peak memory consumption was 338.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:08:47,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.12 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:08:47,367 INFO L168 Benchmark]: Boogie Preprocessor took 114.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:08:47,367 INFO L168 Benchmark]: RCFGBuilder took 10825.79 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 251.1 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -252.9 MB). Peak memory consumption was 637.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:08:47,368 INFO L168 Benchmark]: TraceAbstraction took 222707.99 ms. Allocated memory was 1.6 GB in the beginning and 4.7 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-12-09 01:08:47,368 INFO L168 Benchmark]: Witness Printer took 420.84 ms. Allocated memory is still 4.7 GB. Free memory was 3.1 GB in the beginning and 2.9 GB in the end (delta: 135.1 MB). Peak memory consumption was 135.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:08:47,369 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2115.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 934.5 MB in the beginning and 1.2 GB in the end (delta: -268.6 MB). Peak memory consumption was 338.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.12 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 10825.79 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 251.1 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -252.9 MB). Peak memory consumption was 637.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 222707.99 ms. Allocated memory was 1.6 GB in the beginning and 4.7 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 420.84 ms. Allocated memory is still 4.7 GB. Free memory was 3.1 GB in the beginning and 2.9 GB in the end (delta: 135.1 MB). Peak memory consumption was 135.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.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.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.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.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.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.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.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4282]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20837]: Loop Invariant [2018-12-09 01:08:47,371 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,372 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,372 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,372 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,372 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset Derived loop invariant: (((((((((((((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) || (((0 == pended && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4)) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && status == lowerDriverReturn) || (((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount)) || ((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) || (((0 == pended && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4)) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) && pended == 1) && 0 == customIrp)) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || 0 == s) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 2 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || !(\old(customIrp) == 0) - InvariantResult [Line: 7202]: 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: 5467]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6331]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5858]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21130]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7015]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 5569]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21230]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21385]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4095]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19284]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8618]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19717]: Loop Invariant Derived loop invariant: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || (s == \old(s) && 0 == customIrp) - InvariantResult [Line: 4475]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && PagingReferenceCount == 1)) || !(customIrp == 0)) || !(1 == s) - InvariantResult [Line: 6999]: Loop Invariant Derived loop invariant: ((((((((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == compRegistered && pended == 1) && 0 == customIrp) && !(PagingReferenceCount % 4294967296 == 0)) && s == 4)) || (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && 2 == s)) || ((((0 == pended && 6 == s) && !(0 == compRegistered)) && 1 == setEventCalled) && PagingReferenceCount == 1)) || (((0 == pended && 2 == s) && PagingReferenceCount == 1) && !(259 == ntStatus))) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && PagingReferenceCount == 1) && s == 4)) || ((((0 == pended && 0 == compRegistered) && lowerDriverReturn == ntStatus) && 0 == customIrp) && s == 4)) || (((0 == compRegistered && !(ntStatus == 259)) && 2 == s) && !(PagingReferenceCount % 4294967296 == 0)) - InvariantResult [Line: 20774]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6913]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) - InvariantResult [Line: 8470]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8123]: Loop Invariant Derived loop invariant: (((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21382]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7023]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 21233]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20540]: Loop Invariant Derived loop invariant: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) - InvariantResult [Line: 6345]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21797]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20546]: Loop Invariant Derived loop invariant: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) - InvariantResult [Line: 20829]: Loop Invariant [2018-12-09 01:08:47,378 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,380 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,380 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,380 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,380 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset Derived loop invariant: (((((((((((((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (status == lowerDriverReturn && (((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && pended == 1) && 0 == customIrp)) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || 0 == s) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 2 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || !(\old(customIrp) == 0) - InvariantResult [Line: 8191]: Loop Invariant Derived loop invariant: (((((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) && !(ntStatus == 259)) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (0 == InterfaceType && ((((0 == pended && !(6 == \old(s))) && !(0 == compRegistered)) && 1 == s) && \old(PagingReferenceCount) == PagingReferenceCount) && PagingReferenceCount == 1) - InvariantResult [Line: 5891]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21957]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8989]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20549]: Loop Invariant Derived loop invariant: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) - InvariantResult [Line: 5836]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6997]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 8967]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5688]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5710]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5449]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21453]: Loop Invariant Derived loop invariant: ((((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s)) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 21629]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) || (1 == s && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) && (((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled))) && (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) || (customIrp == \old(customIrp) && 1 == s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (0 == customIrp && 1 == s)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 5458]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20449]: Loop Invariant Derived loop invariant: (((((0 == myStatus || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || !(\old(customIrp) == 0)) && ((((((((0 == pended && customIrp == \old(customIrp)) && __cil_tmp17 == 0) && headOfList == 0) && !(0 == compRegistered)) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1) || ((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s)))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s)))) && ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((((((0 == pended && 0 == compRegistered) && __cil_tmp17 == 0) && headOfList == 0) && 1 == s) && headOfList == 0) && PagingReferenceCount == 1)) || !(1 == \old(s))) - InvariantResult [Line: 19737]: Loop Invariant Derived loop invariant: s == \old(s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 6357]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7418]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 2645]: Loop Invariant Derived loop invariant: (((((0 == ntStatus || !(myStatus == 0)) || !(0 == s)) || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(customIrp == 0) - InvariantResult [Line: 5294]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8878]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4684]: Loop Invariant Derived loop invariant: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) - InvariantResult [Line: 8605]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21954]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4104]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6976]: Loop Invariant Derived loop invariant: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 21794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5455]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4098]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7944]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) - InvariantResult [Line: 5464]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2779]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5487]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21632]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) || (1 == s && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0) && (((((!(customIrp == 1) && customIrp == \old(customIrp)) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || (((0 == customIrp && 1 == \old(customIrp)) && 1 == s) && 1 == setEventCalled))) && (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) || (customIrp == \old(customIrp) && 1 == s))) && ((((!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || (0 == customIrp && 1 == s)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 9011]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9033]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8555]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8824]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21791]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5452]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21456]: Loop Invariant Derived loop invariant: ((((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s)) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 6999]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 4101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6330]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4449]: Loop Invariant Derived loop invariant: (((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s) - InvariantResult [Line: 20450]: Loop Invariant Derived loop invariant: ((((((((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || !(\old(myStatus) == 0)) || 0 == myStatus) || !(\old(customIrp) == 0)) && ((((!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || \old(compRegistered) == 0) || !(1 == \old(s))) || ((((0 == pended && customIrp == \old(customIrp)) && !(0 == compRegistered)) && s == \old(s)) && PagingReferenceCount == 1))) && ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || (((0 == pended && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1)) || !(1 == \old(s)))) && (((((!(\old(setEventCalled) == 1) || !(\old(PagingReferenceCount) == 1)) || !(0 == \old(pended))) || 1 == setEventCalled) || \old(compRegistered) == 0) || !(1 == \old(s))) - InvariantResult [Line: 6046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8617]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20759]: Loop Invariant Derived loop invariant: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 19718]: Loop Invariant Derived loop invariant: ((((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0)) || (s == \old(s) && 0 == customIrp) - InvariantResult [Line: 8944]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19283]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6344]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5914]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22009]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5859]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22031]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21459]: Loop Invariant Derived loop invariant: ((((((!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) || s == \old(s)) && ((((!(PagingReferenceCount == 1) || !(compRegistered == 0)) || !(0 == pended)) || 3 == s) || !(3 == \old(s)))) && ((((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || ((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && s == 5))) && (((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || s == \old(s)) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) - InvariantResult [Line: 6005]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22012]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5473]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5470]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7975]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) - InvariantResult [Line: 5939]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5890]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6912]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) - InvariantResult [Line: 8512]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22034]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6979]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 5835]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21323]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7013]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == customIrp) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 4477]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && PagingReferenceCount == 1)) || !(customIrp == 0)) || !(1 == s) - InvariantResult [Line: 4107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8220]: Loop Invariant Derived loop invariant: ((((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) && ntStatus <= 0) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5440]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20762]: Loop Invariant Derived loop invariant: (((((((0 == pended && 0 == compRegistered) && 1 == s) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 21351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4110]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20851]: Loop Invariant [2018-12-09 01:08:47,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset Derived loop invariant: (((((((((!(\old(myStatus) == 0) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (status == lowerDriverReturn && ((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && !(6 == s)) && !(0 == compRegistered)) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && !(259 == status)) && 0 == PagingReferenceCount)) || ((((0 == pended && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0))) || (((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)))) || ((0 == compRegistered && 2 == s) && !(259 == status))) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || ((pended == 1 && 0 == customIrp) && ((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0)) || (((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && !(6 == s)) && !(0 == compRegistered)) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && !(259 == status)) && 0 == PagingReferenceCount)) || ((((0 == pended && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && (2 <= \old(PagingReferenceCount) || \old(PagingReferenceCount) <= 0))) || (((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && \old(PagingReferenceCount) == PagingReferenceCount) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 2 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || !(\old(customIrp) == 0) - InvariantResult [Line: 8958]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4683]: Loop Invariant Derived loop invariant: ((1 == s || !(compRegistered == 0)) || !(0 == pended)) || !(1 == \old(s)) - InvariantResult [Line: 19738]: Loop Invariant Derived loop invariant: s == \old(s) || (((!(PagingReferenceCount == 1) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) || !(\old(customIrp) == 0) - InvariantResult [Line: 20768]: Loop Invariant Derived loop invariant: (((((((((((0 == pended && 0 == compRegistered) && status == 0) && __cil_tmp14 == 1) && 0 == customIrp) && 1 == s) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 5293]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5443]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6994]: Loop Invariant Derived loop invariant: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 5711]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5292]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20450]: Loop Invariant Derived loop invariant: (!(\old(PagingReferenceCount) == 1) || !(0 == \old(pended))) || !(1 == \old(s)) - InvariantResult [Line: 8990]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21771]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8516]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9010]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6358]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21326]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21607]: Loop Invariant Derived loop invariant: ((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(6 == \old(s))) || !(0 == pended)) || compRegistered == 0) && (((1 == s && 0 == customIrp) || (!(compRegistered == 0) || !(0 == pended)) || !(1 == \old(s))) || !(\old(customIrp) == 0))) && (((((!(1 == pended) || (s == \old(s) && 0 == customIrp)) || !(compRegistered == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || PagingReferenceCount % 4294967296 == 0)) && (((customIrp == \old(customIrp) && 1 == s) && 1 == setEventCalled) || (((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(0 == pended)) || compRegistered == 0) || !(1 == \old(s))) - InvariantResult [Line: 9032]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8509]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8927]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8112]: Loop Invariant Derived loop invariant: (!(ntStatus == 259) && ((0 == pended && !(0 == compRegistered)) && 1 == s) && PagingReferenceCount == 1) || (((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20765]: Loop Invariant Derived loop invariant: (((((((((0 == pended && 0 == compRegistered) && 1 == s) && __cil_tmp14 == 1) && 0 < status + 1) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 2646]: Loop Invariant Derived loop invariant: (((((0 == ntStatus || !(myStatus == 0)) || !(0 == s)) || !(compRegistered == 0)) || !(0 == pended)) || !(PagingReferenceCount == 0)) || !(customIrp == 0) - InvariantResult [Line: 8673]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21738]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7204]: 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: 20129]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21354]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20726]: Loop Invariant [2018-12-09 01:08:47,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,393 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,393 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset [2018-12-09 01:08:47,393 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.base [2018-12-09 01:08:47,393 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~FloppyPnp.offset Derived loop invariant: ((((((((((((((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 6 == s) && !(0 == compRegistered)) && __cil_tmp14 == 1) && 1 == setEventCalled) && 0 == PagingReferenceCount) || !(\old(myStatus) == 0)) || !(0 == \old(s))) || !(\old(PagingReferenceCount) == 0)) || (status == lowerDriverReturn && (((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && __cil_tmp14 == 1) && 1 == setEventCalled) && s == 4) && 0 == PagingReferenceCount)) || ((0 == compRegistered && 2 == s) && !(259 == status))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == compRegistered) && __cil_tmp14 == 1) && s == 4) && pended == 1) && 0 == customIrp)) || (((status == lowerDriverReturn && 0 == pended) && 0 == compRegistered) && s == 4)) || !(\old(compRegistered) == 0)) || 1 == s) || !(0 == \old(pended))) || ((((((#funAddr~FloppyPnp.base == __cil_tmp18 && #funAddr~FloppyPnp.offset == __cil_tmp18) && 0 == pended) && 2 == s) && __cil_tmp14 == 1) && 0 == PagingReferenceCount) && !(259 == status))) || !(\old(customIrp) == 0) - InvariantResult [Line: 5486]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6991]: Loop Invariant Derived loop invariant: ((((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 1 == s) && PagingReferenceCount == 1) - InvariantResult [Line: 5446]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7944]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) - InvariantResult [Line: 7962]: Loop Invariant Derived loop invariant: ((((!(\old(PagingReferenceCount) == 1) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || ((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == customIrp) && PagingReferenceCount == 1) - InvariantResult [Line: 8471]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4447]: Loop Invariant Derived loop invariant: (((((0 == pended && PagingReferenceCount == 1) || !(\old(PagingReferenceCount) == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || !(1 == s) - InvariantResult [Line: 8823]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20771]: 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: 5476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6045]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7212]: 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: 21433]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) || !(compRegistered == 0)) || !(3 == \old(s))) || 3 == s) || !(customIrp == 0)) || PagingReferenceCount % 4294967296 == 0) && ((((((0 == __cil_tmp9 + 1073741802 && 1 == setEventCalled) && returnVal2 == 259) && s == 5) || ((!(0 == pended) || compRegistered == 0) || !(1 == \old(s))) || !(PagingReferenceCount == 1)) || (((0 == __cil_tmp9 + 1073741802 && returnVal2 + 1073741823 <= 0) && 1 == setEventCalled) && s == 5)) || (((0 == __cil_tmp9 + 1073741802 && 0 == returnVal2) && 1 == setEventCalled) && s == 5))) && ((((s == \old(s) || !(PagingReferenceCount == 1)) || !(compRegistered == 0)) || !(0 == pended)) || !(3 == \old(s)))) && ((3 == s || (!(compRegistered == 0) || !(0 == pended)) || !(3 == \old(s))) || !(customIrp == 0)) - InvariantResult [Line: 21735]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7474]: Loop Invariant Derived loop invariant: ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && s == \old(s)) && PagingReferenceCount == 1) || (((!(\old(compRegistered) == 0) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || !(\old(customIrp) == 0)) || !(1 == \old(s)) - InvariantResult [Line: 8557]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8506]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6985]: 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: 2780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21863]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5913]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 64 procedures, 981 locations, 1 error locations. SAFE Result, 222.5s OverallTime, 62 OverallIterations, 7 TraceHistogramMax, 161.3s AutomataDifference, 0.0s DeadEndRemovalTime, 35.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 68255 SDtfs, 21452 SDslu, 289441 SDs, 0 SdLazy, 22586 SolverSat, 3898 SolverUnsat, 59 SolverUnknown, 0 SolverNotchecked, 143.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1786 GetRequests, 1279 SyntacticMatches, 27 SemanticMatches, 480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82234occurred 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: 12.4s AutomataMinimizationTime, 62 MinimizatonAttempts, 5682 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 422 LocationsWithAnnotation, 228445 PreInvPairs, 228897 NumberOfFragments, 9926 HoareAnnotationTreeSize, 228445 FomulaSimplifications, 151629 FormulaSimplificationTreeSizeReduction, 8.7s HoareSimplificationTime, 422 FomulaSimplificationsInter, 99378 FormulaSimplificationTreeSizeReductionInter, 25.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 9796 NumberOfCodeBlocks, 9796 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 9728 ConstructedInterpolants, 0 QuantifiedInterpolants, 2356596 SizeOfPredicates, 34 NumberOfNonLiveVariables, 22802 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 68 InterpolantComputations, 60 PerfectInterpolantSequences, 1199/1239 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...