./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9187bc92090d01e0892e8fd14c7d6a75e3556b66 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:08:25,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:08:25,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:08:25,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:08:25,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:08:25,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:08:25,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:08:25,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:08:25,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:08:25,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:08:25,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:08:25,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:08:25,352 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:08:25,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:08:25,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:08:25,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:08:25,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:08:25,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:08:25,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:08:25,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:08:25,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:08:25,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:08:25,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:08:25,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:08:25,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:08:25,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:08:25,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:08:25,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:08:25,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:08:25,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:08:25,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:08:25,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:08:25,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:08:25,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:08:25,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:08:25,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:08:25,368 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 10:08:25,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:08:25,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:08:25,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:08:25,379 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 10:08:25,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:08:25,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:08:25,380 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:08:25,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:08:25,380 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:08:25,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:08:25,380 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:08:25,381 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:08:25,381 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:08:25,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:08:25,381 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:08:25,381 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:08:25,381 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:08:25,381 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:08:25,382 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:08:25,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:08:25,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:08:25,382 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:08:25,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:08:25,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:08:25,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:08:25,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:08:25,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:08:25,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:08:25,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:08:25,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:08:25,383 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_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9187bc92090d01e0892e8fd14c7d6a75e3556b66 [2018-11-18 10:08:25,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:08:25,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:08:25,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:08:25,416 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:08:25,416 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:08:25,417 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 10:08:25,452 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/data/cf43de80d/17920a45a1394499abdc7c495d76ddd0/FLAG22ed8be43 [2018-11-18 10:08:25,906 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:08:25,907 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 10:08:25,919 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/data/cf43de80d/17920a45a1394499abdc7c495d76ddd0/FLAG22ed8be43 [2018-11-18 10:08:25,930 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/data/cf43de80d/17920a45a1394499abdc7c495d76ddd0 [2018-11-18 10:08:25,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:08:25,933 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 10:08:25,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:08:25,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:08:25,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:08:25,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:08:25" (1/1) ... [2018-11-18 10:08:25,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf57369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:25, skipping insertion in model container [2018-11-18 10:08:25,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:08:25" (1/1) ... [2018-11-18 10:08:25,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:08:25,979 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:08:26,196 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:08:26,200 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:08:26,326 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:08:26,344 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:08:26,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26 WrapperNode [2018-11-18 10:08:26,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:08:26,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:08:26,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:08:26,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:08:26,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (1/1) ... [2018-11-18 10:08:26,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (1/1) ... [2018-11-18 10:08:26,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (1/1) ... [2018-11-18 10:08:26,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (1/1) ... [2018-11-18 10:08:26,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (1/1) ... [2018-11-18 10:08:26,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (1/1) ... [2018-11-18 10:08:26,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (1/1) ... [2018-11-18 10:08:26,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:08:26,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:08:26,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:08:26,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:08:26,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:08:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:08:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:08:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 10:08:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-18 10:08:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-18 10:08:26,460 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-18 10:08:26,461 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-18 10:08:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-18 10:08:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-18 10:08:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 10:08:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 10:08:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 10:08:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 10:08:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 10:08:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-18 10:08:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-18 10:08:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-18 10:08:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-18 10:08:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-18 10:08:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-18 10:08:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-18 10:08:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 10:08:26,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 10:08:26,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 10:08:26,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-18 10:08:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-18 10:08:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 10:08:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:08:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 10:08:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:08:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:08:26,638 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:26,639 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:26,690 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:26,690 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:26,702 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:26,702 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:26,869 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:26,869 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:26,944 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:26,945 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,031 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:27,031 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,037 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:27,038 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,052 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:27,052 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,081 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:27,081 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,109 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:27,109 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,212 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:27,212 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,215 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:27,215 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,229 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:08:27,229 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:08:27,239 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:08:27,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:08:27 BoogieIcfgContainer [2018-11-18 10:08:27,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:08:27,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:08:27,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:08:27,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:08:27,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:08:25" (1/3) ... [2018-11-18 10:08:27,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64124287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:08:27, skipping insertion in model container [2018-11-18 10:08:27,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:08:26" (2/3) ... [2018-11-18 10:08:27,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64124287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:08:27, skipping insertion in model container [2018-11-18 10:08:27,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:08:27" (3/3) ... [2018-11-18 10:08:27,245 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 10:08:27,251 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:08:27,257 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:08:27,266 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:08:27,289 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:08:27,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:08:27,289 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:08:27,290 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:08:27,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:08:27,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:08:27,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:08:27,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:08:27,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:08:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states. [2018-11-18 10:08:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:08:27,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:27,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:27,317 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:27,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1098335980, now seen corresponding path program 1 times [2018-11-18 10:08:27,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:27,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:27,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:27,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:27,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:27,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:27,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:27,517 INFO L87 Difference]: Start difference. First operand 390 states. Second operand 3 states. [2018-11-18 10:08:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:27,609 INFO L93 Difference]: Finished difference Result 626 states and 911 transitions. [2018-11-18 10:08:27,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:27,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:08:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:27,621 INFO L225 Difference]: With dead ends: 626 [2018-11-18 10:08:27,621 INFO L226 Difference]: Without dead ends: 381 [2018-11-18 10:08:27,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-18 10:08:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-18 10:08:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-18 10:08:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 524 transitions. [2018-11-18 10:08:27,675 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 524 transitions. Word has length 20 [2018-11-18 10:08:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:27,675 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 524 transitions. [2018-11-18 10:08:27,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 524 transitions. [2018-11-18 10:08:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:08:27,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:27,677 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:27,677 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:27,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1064921131, now seen corresponding path program 1 times [2018-11-18 10:08:27,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:27,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:27,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:27,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:27,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:27,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:27,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:27,807 INFO L87 Difference]: Start difference. First operand 381 states and 524 transitions. Second operand 3 states. [2018-11-18 10:08:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:27,963 INFO L93 Difference]: Finished difference Result 702 states and 953 transitions. [2018-11-18 10:08:27,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:27,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:08:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:27,968 INFO L225 Difference]: With dead ends: 702 [2018-11-18 10:08:27,969 INFO L226 Difference]: Without dead ends: 538 [2018-11-18 10:08:27,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-11-18 10:08:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 521. [2018-11-18 10:08:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-18 10:08:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 708 transitions. [2018-11-18 10:08:28,005 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 708 transitions. Word has length 25 [2018-11-18 10:08:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:28,006 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 708 transitions. [2018-11-18 10:08:28,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 708 transitions. [2018-11-18 10:08:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 10:08:28,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:28,008 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:28,009 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:28,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1723045672, now seen corresponding path program 1 times [2018-11-18 10:08:28,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:28,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:28,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:28,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:28,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:28,083 INFO L87 Difference]: Start difference. First operand 521 states and 708 transitions. Second operand 3 states. [2018-11-18 10:08:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:28,148 INFO L93 Difference]: Finished difference Result 644 states and 861 transitions. [2018-11-18 10:08:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:28,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 10:08:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:28,154 INFO L225 Difference]: With dead ends: 644 [2018-11-18 10:08:28,154 INFO L226 Difference]: Without dead ends: 625 [2018-11-18 10:08:28,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-18 10:08:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 579. [2018-11-18 10:08:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 10:08:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 782 transitions. [2018-11-18 10:08:28,185 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 782 transitions. Word has length 31 [2018-11-18 10:08:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:28,185 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 782 transitions. [2018-11-18 10:08:28,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 782 transitions. [2018-11-18 10:08:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 10:08:28,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:28,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:28,188 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:28,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:28,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1972802819, now seen corresponding path program 1 times [2018-11-18 10:08:28,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:28,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:28,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:28,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:28,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:28,242 INFO L87 Difference]: Start difference. First operand 579 states and 782 transitions. Second operand 3 states. [2018-11-18 10:08:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:28,289 INFO L93 Difference]: Finished difference Result 1086 states and 1461 transitions. [2018-11-18 10:08:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:28,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 10:08:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:28,294 INFO L225 Difference]: With dead ends: 1086 [2018-11-18 10:08:28,294 INFO L226 Difference]: Without dead ends: 792 [2018-11-18 10:08:28,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-11-18 10:08:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 763. [2018-11-18 10:08:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-18 10:08:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1034 transitions. [2018-11-18 10:08:28,332 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1034 transitions. Word has length 33 [2018-11-18 10:08:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:28,332 INFO L480 AbstractCegarLoop]: Abstraction has 763 states and 1034 transitions. [2018-11-18 10:08:28,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1034 transitions. [2018-11-18 10:08:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 10:08:28,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:28,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:28,334 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:28,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 234590186, now seen corresponding path program 1 times [2018-11-18 10:08:28,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:28,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:28,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:28,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:28,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:28,390 INFO L87 Difference]: Start difference. First operand 763 states and 1034 transitions. Second operand 3 states. [2018-11-18 10:08:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:28,499 INFO L93 Difference]: Finished difference Result 799 states and 1076 transitions. [2018-11-18 10:08:28,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:28,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 10:08:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:28,504 INFO L225 Difference]: With dead ends: 799 [2018-11-18 10:08:28,504 INFO L226 Difference]: Without dead ends: 794 [2018-11-18 10:08:28,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-18 10:08:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-11-18 10:08:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-18 10:08:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1069 transitions. [2018-11-18 10:08:28,542 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1069 transitions. Word has length 38 [2018-11-18 10:08:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:28,543 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1069 transitions. [2018-11-18 10:08:28,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1069 transitions. [2018-11-18 10:08:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 10:08:28,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:28,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:28,545 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:28,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash 800532412, now seen corresponding path program 1 times [2018-11-18 10:08:28,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:28,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:28,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:28,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:28,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:28,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:28,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:28,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:28,615 INFO L87 Difference]: Start difference. First operand 792 states and 1069 transitions. Second operand 3 states. [2018-11-18 10:08:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:28,727 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2018-11-18 10:08:28,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:28,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 10:08:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:28,732 INFO L225 Difference]: With dead ends: 807 [2018-11-18 10:08:28,732 INFO L226 Difference]: Without dead ends: 804 [2018-11-18 10:08:28,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-18 10:08:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 803. [2018-11-18 10:08:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-11-18 10:08:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1083 transitions. [2018-11-18 10:08:28,762 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1083 transitions. Word has length 38 [2018-11-18 10:08:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:28,762 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1083 transitions. [2018-11-18 10:08:28,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1083 transitions. [2018-11-18 10:08:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 10:08:28,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:28,764 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:28,764 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:28,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash -865990947, now seen corresponding path program 1 times [2018-11-18 10:08:28,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:28,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:28,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:28,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:28,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:28,809 INFO L87 Difference]: Start difference. First operand 803 states and 1083 transitions. Second operand 5 states. [2018-11-18 10:08:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:28,861 INFO L93 Difference]: Finished difference Result 816 states and 1097 transitions. [2018-11-18 10:08:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:28,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-18 10:08:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:28,865 INFO L225 Difference]: With dead ends: 816 [2018-11-18 10:08:28,865 INFO L226 Difference]: Without dead ends: 801 [2018-11-18 10:08:28,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-18 10:08:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-18 10:08:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-18 10:08:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1079 transitions. [2018-11-18 10:08:28,897 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1079 transitions. Word has length 39 [2018-11-18 10:08:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:28,897 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1079 transitions. [2018-11-18 10:08:28,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1079 transitions. [2018-11-18 10:08:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 10:08:28,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:28,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:28,900 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:28,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1772394300, now seen corresponding path program 1 times [2018-11-18 10:08:28,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:28,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:28,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:28,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:28,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:28,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:28,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:28,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:28,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:28,934 INFO L87 Difference]: Start difference. First operand 801 states and 1079 transitions. Second operand 5 states. [2018-11-18 10:08:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:28,995 INFO L93 Difference]: Finished difference Result 814 states and 1093 transitions. [2018-11-18 10:08:28,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:28,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-18 10:08:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:29,000 INFO L225 Difference]: With dead ends: 814 [2018-11-18 10:08:29,000 INFO L226 Difference]: Without dead ends: 794 [2018-11-18 10:08:29,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-18 10:08:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2018-11-18 10:08:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-11-18 10:08:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1070 transitions. [2018-11-18 10:08:29,030 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1070 transitions. Word has length 40 [2018-11-18 10:08:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:29,031 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 1070 transitions. [2018-11-18 10:08:29,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1070 transitions. [2018-11-18 10:08:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:08:29,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:29,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:29,032 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:29,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1726819464, now seen corresponding path program 1 times [2018-11-18 10:08:29,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:29,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:29,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:29,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:29,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:29,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:29,067 INFO L87 Difference]: Start difference. First operand 794 states and 1070 transitions. Second operand 3 states. [2018-11-18 10:08:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:29,163 INFO L93 Difference]: Finished difference Result 1176 states and 1598 transitions. [2018-11-18 10:08:29,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:29,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-18 10:08:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:29,168 INFO L225 Difference]: With dead ends: 1176 [2018-11-18 10:08:29,168 INFO L226 Difference]: Without dead ends: 1173 [2018-11-18 10:08:29,169 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2018-11-18 10:08:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 919. [2018-11-18 10:08:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-11-18 10:08:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1241 transitions. [2018-11-18 10:08:29,211 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1241 transitions. Word has length 44 [2018-11-18 10:08:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:29,212 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1241 transitions. [2018-11-18 10:08:29,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1241 transitions. [2018-11-18 10:08:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 10:08:29,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:29,213 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:29,213 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:29,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1534169537, now seen corresponding path program 1 times [2018-11-18 10:08:29,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:29,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:29,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:29,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:29,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:29,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:29,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:29,276 INFO L87 Difference]: Start difference. First operand 919 states and 1241 transitions. Second operand 5 states. [2018-11-18 10:08:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:29,602 INFO L93 Difference]: Finished difference Result 927 states and 1247 transitions. [2018-11-18 10:08:29,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:29,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-18 10:08:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:29,607 INFO L225 Difference]: With dead ends: 927 [2018-11-18 10:08:29,609 INFO L226 Difference]: Without dead ends: 921 [2018-11-18 10:08:29,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-11-18 10:08:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 919. [2018-11-18 10:08:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-11-18 10:08:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1240 transitions. [2018-11-18 10:08:29,651 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1240 transitions. Word has length 43 [2018-11-18 10:08:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:29,651 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1240 transitions. [2018-11-18 10:08:29,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1240 transitions. [2018-11-18 10:08:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 10:08:29,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:29,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:29,653 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:29,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1988047197, now seen corresponding path program 1 times [2018-11-18 10:08:29,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:29,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:29,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:29,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:29,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:08:29,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:08:29,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:08:29,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:08:29,707 INFO L87 Difference]: Start difference. First operand 919 states and 1240 transitions. Second operand 4 states. [2018-11-18 10:08:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:29,786 INFO L93 Difference]: Finished difference Result 947 states and 1273 transitions. [2018-11-18 10:08:29,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:08:29,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-18 10:08:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:29,791 INFO L225 Difference]: With dead ends: 947 [2018-11-18 10:08:29,791 INFO L226 Difference]: Without dead ends: 925 [2018-11-18 10:08:29,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-18 10:08:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2018-11-18 10:08:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-11-18 10:08:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1242 transitions. [2018-11-18 10:08:29,834 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1242 transitions. Word has length 42 [2018-11-18 10:08:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:29,834 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1242 transitions. [2018-11-18 10:08:29,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:08:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1242 transitions. [2018-11-18 10:08:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 10:08:29,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:29,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:29,836 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:29,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1753737204, now seen corresponding path program 1 times [2018-11-18 10:08:29,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:29,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:29,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:29,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-11-18 10:08:29,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:29,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:29,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:29,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:29,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:29,900 INFO L87 Difference]: Start difference. First operand 921 states and 1242 transitions. Second operand 5 states. [2018-11-18 10:08:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:30,462 INFO L93 Difference]: Finished difference Result 1652 states and 2197 transitions. [2018-11-18 10:08:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:30,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-18 10:08:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:30,465 INFO L225 Difference]: With dead ends: 1652 [2018-11-18 10:08:30,465 INFO L226 Difference]: Without dead ends: 1095 [2018-11-18 10:08:30,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-11-18 10:08:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 912. [2018-11-18 10:08:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-11-18 10:08:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1221 transitions. [2018-11-18 10:08:30,495 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1221 transitions. Word has length 45 [2018-11-18 10:08:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:30,495 INFO L480 AbstractCegarLoop]: Abstraction has 912 states and 1221 transitions. [2018-11-18 10:08:30,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1221 transitions. [2018-11-18 10:08:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:08:30,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:30,496 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:30,496 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:30,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:30,496 INFO L82 PathProgramCache]: Analyzing trace with hash -546005933, now seen corresponding path program 1 times [2018-11-18 10:08:30,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:30,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:30,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:30,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:30,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:30,541 INFO L87 Difference]: Start difference. First operand 912 states and 1221 transitions. Second operand 5 states. [2018-11-18 10:08:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:30,741 INFO L93 Difference]: Finished difference Result 920 states and 1227 transitions. [2018-11-18 10:08:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:30,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 10:08:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:30,744 INFO L225 Difference]: With dead ends: 920 [2018-11-18 10:08:30,744 INFO L226 Difference]: Without dead ends: 914 [2018-11-18 10:08:30,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-11-18 10:08:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2018-11-18 10:08:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-11-18 10:08:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1220 transitions. [2018-11-18 10:08:30,771 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1220 transitions. Word has length 44 [2018-11-18 10:08:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:30,772 INFO L480 AbstractCegarLoop]: Abstraction has 912 states and 1220 transitions. [2018-11-18 10:08:30,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1220 transitions. [2018-11-18 10:08:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 10:08:30,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:30,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:30,773 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:30,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:30,773 INFO L82 PathProgramCache]: Analyzing trace with hash -389894069, now seen corresponding path program 1 times [2018-11-18 10:08:30,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:30,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:30,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:30,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:30,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:08:30,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:08:30,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:08:30,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:08:30,805 INFO L87 Difference]: Start difference. First operand 912 states and 1220 transitions. Second operand 4 states. [2018-11-18 10:08:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:30,851 INFO L93 Difference]: Finished difference Result 940 states and 1253 transitions. [2018-11-18 10:08:30,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:08:30,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-18 10:08:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:30,854 INFO L225 Difference]: With dead ends: 940 [2018-11-18 10:08:30,854 INFO L226 Difference]: Without dead ends: 918 [2018-11-18 10:08:30,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-11-18 10:08:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 912. [2018-11-18 10:08:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-11-18 10:08:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1220 transitions. [2018-11-18 10:08:30,883 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1220 transitions. Word has length 43 [2018-11-18 10:08:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:30,884 INFO L480 AbstractCegarLoop]: Abstraction has 912 states and 1220 transitions. [2018-11-18 10:08:30,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:08:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1220 transitions. [2018-11-18 10:08:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 10:08:30,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:30,885 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:30,885 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:30,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash 337231274, now seen corresponding path program 1 times [2018-11-18 10:08:30,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:30,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:30,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:30,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:30,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:30,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:30,916 INFO L87 Difference]: Start difference. First operand 912 states and 1220 transitions. Second operand 5 states. [2018-11-18 10:08:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:30,955 INFO L93 Difference]: Finished difference Result 928 states and 1235 transitions. [2018-11-18 10:08:30,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:30,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-18 10:08:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:30,958 INFO L225 Difference]: With dead ends: 928 [2018-11-18 10:08:30,958 INFO L226 Difference]: Without dead ends: 910 [2018-11-18 10:08:30,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-11-18 10:08:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2018-11-18 10:08:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-11-18 10:08:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1216 transitions. [2018-11-18 10:08:30,987 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1216 transitions. Word has length 45 [2018-11-18 10:08:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:30,987 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 1216 transitions. [2018-11-18 10:08:30,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1216 transitions. [2018-11-18 10:08:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 10:08:30,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:30,989 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:30,989 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:30,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1555095157, now seen corresponding path program 1 times [2018-11-18 10:08:30,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:30,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:30,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:31,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:31,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:31,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:31,011 INFO L87 Difference]: Start difference. First operand 910 states and 1216 transitions. Second operand 3 states. [2018-11-18 10:08:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:31,055 INFO L93 Difference]: Finished difference Result 950 states and 1263 transitions. [2018-11-18 10:08:31,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:31,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 10:08:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:31,058 INFO L225 Difference]: With dead ends: 950 [2018-11-18 10:08:31,058 INFO L226 Difference]: Without dead ends: 874 [2018-11-18 10:08:31,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-18 10:08:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 871. [2018-11-18 10:08:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-11-18 10:08:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1165 transitions. [2018-11-18 10:08:31,084 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1165 transitions. Word has length 46 [2018-11-18 10:08:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:31,085 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1165 transitions. [2018-11-18 10:08:31,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1165 transitions. [2018-11-18 10:08:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 10:08:31,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:31,086 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:31,086 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:31,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1650529097, now seen corresponding path program 1 times [2018-11-18 10:08:31,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:31,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:31,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:31,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:31,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:31,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:31,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:31,126 INFO L87 Difference]: Start difference. First operand 871 states and 1165 transitions. Second operand 5 states. [2018-11-18 10:08:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:31,157 INFO L93 Difference]: Finished difference Result 887 states and 1180 transitions. [2018-11-18 10:08:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:31,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-18 10:08:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:31,160 INFO L225 Difference]: With dead ends: 887 [2018-11-18 10:08:31,160 INFO L226 Difference]: Without dead ends: 869 [2018-11-18 10:08:31,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-18 10:08:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2018-11-18 10:08:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-18 10:08:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1161 transitions. [2018-11-18 10:08:31,188 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1161 transitions. Word has length 47 [2018-11-18 10:08:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:31,188 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1161 transitions. [2018-11-18 10:08:31,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1161 transitions. [2018-11-18 10:08:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 10:08:31,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:31,190 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:31,190 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:31,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2011020046, now seen corresponding path program 1 times [2018-11-18 10:08:31,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:31,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:31,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:31,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:08:31,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:08:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:08:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:08:31,223 INFO L87 Difference]: Start difference. First operand 869 states and 1161 transitions. Second operand 4 states. [2018-11-18 10:08:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:31,359 INFO L93 Difference]: Finished difference Result 953 states and 1244 transitions. [2018-11-18 10:08:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:08:31,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-11-18 10:08:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:31,362 INFO L225 Difference]: With dead ends: 953 [2018-11-18 10:08:31,362 INFO L226 Difference]: Without dead ends: 616 [2018-11-18 10:08:31,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:08:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-11-18 10:08:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 579. [2018-11-18 10:08:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 10:08:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 750 transitions. [2018-11-18 10:08:31,386 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 750 transitions. Word has length 52 [2018-11-18 10:08:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:31,386 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 750 transitions. [2018-11-18 10:08:31,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:08:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 750 transitions. [2018-11-18 10:08:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 10:08:31,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:31,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:31,388 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:31,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1830977757, now seen corresponding path program 1 times [2018-11-18 10:08:31,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:31,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:31,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:08:31,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:08:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:08:31,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:31,461 INFO L87 Difference]: Start difference. First operand 579 states and 750 transitions. Second operand 6 states. [2018-11-18 10:08:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:31,511 INFO L93 Difference]: Finished difference Result 599 states and 770 transitions. [2018-11-18 10:08:31,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:31,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 10:08:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:31,514 INFO L225 Difference]: With dead ends: 599 [2018-11-18 10:08:31,514 INFO L226 Difference]: Without dead ends: 579 [2018-11-18 10:08:31,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-11-18 10:08:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2018-11-18 10:08:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 10:08:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2018-11-18 10:08:31,534 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 50 [2018-11-18 10:08:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:31,534 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2018-11-18 10:08:31,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:08:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2018-11-18 10:08:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 10:08:31,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:31,535 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:31,535 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:31,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:31,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1530310595, now seen corresponding path program 1 times [2018-11-18 10:08:31,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:31,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:31,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:31,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:31,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:31,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:31,570 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand 3 states. [2018-11-18 10:08:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:31,641 INFO L93 Difference]: Finished difference Result 782 states and 1007 transitions. [2018-11-18 10:08:31,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:31,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 10:08:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:31,644 INFO L225 Difference]: With dead ends: 782 [2018-11-18 10:08:31,644 INFO L226 Difference]: Without dead ends: 755 [2018-11-18 10:08:31,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-18 10:08:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 624. [2018-11-18 10:08:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-11-18 10:08:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 795 transitions. [2018-11-18 10:08:31,666 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 795 transitions. Word has length 50 [2018-11-18 10:08:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:31,667 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 795 transitions. [2018-11-18 10:08:31,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 795 transitions. [2018-11-18 10:08:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 10:08:31,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:31,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:31,668 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:31,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1843149445, now seen corresponding path program 1 times [2018-11-18 10:08:31,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:31,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:31,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:31,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:31,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:08:31,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:08:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:08:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:31,708 INFO L87 Difference]: Start difference. First operand 624 states and 795 transitions. Second operand 7 states. [2018-11-18 10:08:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:31,776 INFO L93 Difference]: Finished difference Result 663 states and 838 transitions. [2018-11-18 10:08:31,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:08:31,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-18 10:08:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:31,779 INFO L225 Difference]: With dead ends: 663 [2018-11-18 10:08:31,779 INFO L226 Difference]: Without dead ends: 614 [2018-11-18 10:08:31,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:08:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-18 10:08:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2018-11-18 10:08:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-18 10:08:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2018-11-18 10:08:31,799 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2018-11-18 10:08:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:31,800 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2018-11-18 10:08:31,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:08:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2018-11-18 10:08:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 10:08:31,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:31,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:31,801 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:31,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:31,801 INFO L82 PathProgramCache]: Analyzing trace with hash 517866388, now seen corresponding path program 1 times [2018-11-18 10:08:31,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:31,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:31,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:31,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:08:31,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:08:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:08:31,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:31,838 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 6 states. [2018-11-18 10:08:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:31,876 INFO L93 Difference]: Finished difference Result 639 states and 807 transitions. [2018-11-18 10:08:31,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:31,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-18 10:08:31,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:31,879 INFO L225 Difference]: With dead ends: 639 [2018-11-18 10:08:31,879 INFO L226 Difference]: Without dead ends: 614 [2018-11-18 10:08:31,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-18 10:08:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2018-11-18 10:08:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-18 10:08:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 778 transitions. [2018-11-18 10:08:31,900 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 778 transitions. Word has length 51 [2018-11-18 10:08:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:31,900 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 778 transitions. [2018-11-18 10:08:31,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:08:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 778 transitions. [2018-11-18 10:08:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 10:08:31,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:31,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:31,901 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:31,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:31,902 INFO L82 PathProgramCache]: Analyzing trace with hash 646912898, now seen corresponding path program 1 times [2018-11-18 10:08:31,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:31,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:31,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:31,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 10:08:31,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:08:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:08:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:08:31,947 INFO L87 Difference]: Start difference. First operand 614 states and 778 transitions. Second operand 8 states. [2018-11-18 10:08:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:32,053 INFO L93 Difference]: Finished difference Result 644 states and 812 transitions. [2018-11-18 10:08:32,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:08:32,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-18 10:08:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:32,056 INFO L225 Difference]: With dead ends: 644 [2018-11-18 10:08:32,056 INFO L226 Difference]: Without dead ends: 640 [2018-11-18 10:08:32,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-11-18 10:08:32,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 632. [2018-11-18 10:08:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-11-18 10:08:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 799 transitions. [2018-11-18 10:08:32,078 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 799 transitions. Word has length 51 [2018-11-18 10:08:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:32,079 INFO L480 AbstractCegarLoop]: Abstraction has 632 states and 799 transitions. [2018-11-18 10:08:32,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:08:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 799 transitions. [2018-11-18 10:08:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 10:08:32,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:32,080 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:32,080 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:32,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:32,080 INFO L82 PathProgramCache]: Analyzing trace with hash 646636068, now seen corresponding path program 1 times [2018-11-18 10:08:32,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:32,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:32,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:32,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:32,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:32,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:32,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 10:08:32,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:08:32,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:08:32,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:08:32,127 INFO L87 Difference]: Start difference. First operand 632 states and 799 transitions. Second operand 8 states. [2018-11-18 10:08:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:32,192 INFO L93 Difference]: Finished difference Result 1028 states and 1322 transitions. [2018-11-18 10:08:32,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:08:32,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-18 10:08:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:32,194 INFO L225 Difference]: With dead ends: 1028 [2018-11-18 10:08:32,194 INFO L226 Difference]: Without dead ends: 672 [2018-11-18 10:08:32,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:08:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-11-18 10:08:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 653. [2018-11-18 10:08:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-11-18 10:08:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 837 transitions. [2018-11-18 10:08:32,218 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 837 transitions. Word has length 51 [2018-11-18 10:08:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:32,218 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 837 transitions. [2018-11-18 10:08:32,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:08:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 837 transitions. [2018-11-18 10:08:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 10:08:32,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:32,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:32,220 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:32,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1336246450, now seen corresponding path program 1 times [2018-11-18 10:08:32,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:32,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:32,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:32,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:32,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:32,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:32,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:32,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:32,281 INFO L87 Difference]: Start difference. First operand 653 states and 837 transitions. Second operand 9 states. [2018-11-18 10:08:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:33,172 INFO L93 Difference]: Finished difference Result 1007 states and 1282 transitions. [2018-11-18 10:08:33,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 10:08:33,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-18 10:08:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:33,176 INFO L225 Difference]: With dead ends: 1007 [2018-11-18 10:08:33,176 INFO L226 Difference]: Without dead ends: 940 [2018-11-18 10:08:33,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-11-18 10:08:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-11-18 10:08:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 705. [2018-11-18 10:08:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-11-18 10:08:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 910 transitions. [2018-11-18 10:08:33,203 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 910 transitions. Word has length 52 [2018-11-18 10:08:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:33,203 INFO L480 AbstractCegarLoop]: Abstraction has 705 states and 910 transitions. [2018-11-18 10:08:33,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 910 transitions. [2018-11-18 10:08:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 10:08:33,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:33,205 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:33,205 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:33,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1121853832, now seen corresponding path program 1 times [2018-11-18 10:08:33,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:33,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:33,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:33,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:33,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:33,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:33,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:33,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:33,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:33,226 INFO L87 Difference]: Start difference. First operand 705 states and 910 transitions. Second operand 3 states. [2018-11-18 10:08:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:33,299 INFO L93 Difference]: Finished difference Result 942 states and 1228 transitions. [2018-11-18 10:08:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:33,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-18 10:08:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:33,302 INFO L225 Difference]: With dead ends: 942 [2018-11-18 10:08:33,302 INFO L226 Difference]: Without dead ends: 899 [2018-11-18 10:08:33,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-11-18 10:08:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 750. [2018-11-18 10:08:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-11-18 10:08:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 957 transitions. [2018-11-18 10:08:33,332 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 957 transitions. Word has length 52 [2018-11-18 10:08:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:33,332 INFO L480 AbstractCegarLoop]: Abstraction has 750 states and 957 transitions. [2018-11-18 10:08:33,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 957 transitions. [2018-11-18 10:08:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 10:08:33,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:33,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:33,334 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:33,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:33,334 INFO L82 PathProgramCache]: Analyzing trace with hash 978574474, now seen corresponding path program 1 times [2018-11-18 10:08:33,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:33,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:33,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:33,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:33,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:08:33,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:08:33,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:08:33,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:33,376 INFO L87 Difference]: Start difference. First operand 750 states and 957 transitions. Second operand 7 states. [2018-11-18 10:08:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:33,807 INFO L93 Difference]: Finished difference Result 806 states and 1024 transitions. [2018-11-18 10:08:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:08:33,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-18 10:08:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:33,810 INFO L225 Difference]: With dead ends: 806 [2018-11-18 10:08:33,810 INFO L226 Difference]: Without dead ends: 662 [2018-11-18 10:08:33,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:08:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-11-18 10:08:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 622. [2018-11-18 10:08:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-18 10:08:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 791 transitions. [2018-11-18 10:08:33,836 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 791 transitions. Word has length 52 [2018-11-18 10:08:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:33,836 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 791 transitions. [2018-11-18 10:08:33,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:08:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 791 transitions. [2018-11-18 10:08:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 10:08:33,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:33,838 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:33,838 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:33,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1512929268, now seen corresponding path program 1 times [2018-11-18 10:08:33,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:33,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:33,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:33,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:33,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:33,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:33,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:33,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:33,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:33,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:33,876 INFO L87 Difference]: Start difference. First operand 622 states and 791 transitions. Second operand 3 states. [2018-11-18 10:08:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:33,924 INFO L93 Difference]: Finished difference Result 932 states and 1192 transitions. [2018-11-18 10:08:33,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:33,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-18 10:08:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:33,927 INFO L225 Difference]: With dead ends: 932 [2018-11-18 10:08:33,927 INFO L226 Difference]: Without dead ends: 621 [2018-11-18 10:08:33,928 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-18 10:08:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-18 10:08:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-18 10:08:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 787 transitions. [2018-11-18 10:08:33,954 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 787 transitions. Word has length 58 [2018-11-18 10:08:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:33,955 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 787 transitions. [2018-11-18 10:08:33,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 787 transitions. [2018-11-18 10:08:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 10:08:33,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:33,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:33,957 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:33,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2010209367, now seen corresponding path program 1 times [2018-11-18 10:08:33,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:33,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:33,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:33,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:33,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:33,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:33,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:33,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:33,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:33,993 INFO L87 Difference]: Start difference. First operand 621 states and 787 transitions. Second operand 5 states. [2018-11-18 10:08:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:34,255 INFO L93 Difference]: Finished difference Result 706 states and 894 transitions. [2018-11-18 10:08:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:34,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 10:08:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:34,258 INFO L225 Difference]: With dead ends: 706 [2018-11-18 10:08:34,258 INFO L226 Difference]: Without dead ends: 688 [2018-11-18 10:08:34,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-11-18 10:08:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 623. [2018-11-18 10:08:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-11-18 10:08:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 787 transitions. [2018-11-18 10:08:34,285 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 787 transitions. Word has length 54 [2018-11-18 10:08:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:34,285 INFO L480 AbstractCegarLoop]: Abstraction has 623 states and 787 transitions. [2018-11-18 10:08:34,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 787 transitions. [2018-11-18 10:08:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 10:08:34,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:34,286 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:34,286 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:34,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1896275701, now seen corresponding path program 1 times [2018-11-18 10:08:34,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:34,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:34,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:34,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:34,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:08:34,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:08:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:08:34,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:08:34,327 INFO L87 Difference]: Start difference. First operand 623 states and 787 transitions. Second operand 4 states. [2018-11-18 10:08:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:34,542 INFO L93 Difference]: Finished difference Result 1344 states and 1682 transitions. [2018-11-18 10:08:34,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:08:34,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-18 10:08:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:34,545 INFO L225 Difference]: With dead ends: 1344 [2018-11-18 10:08:34,545 INFO L226 Difference]: Without dead ends: 1179 [2018-11-18 10:08:34,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:08:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-11-18 10:08:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1109. [2018-11-18 10:08:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-11-18 10:08:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1411 transitions. [2018-11-18 10:08:34,635 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1411 transitions. Word has length 55 [2018-11-18 10:08:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:34,635 INFO L480 AbstractCegarLoop]: Abstraction has 1109 states and 1411 transitions. [2018-11-18 10:08:34,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:08:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1411 transitions. [2018-11-18 10:08:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 10:08:34,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:34,637 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:34,637 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:34,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:34,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1975989769, now seen corresponding path program 1 times [2018-11-18 10:08:34,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:34,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:34,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:34,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:34,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 10:08:34,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:08:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:08:34,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:08:34,724 INFO L87 Difference]: Start difference. First operand 1109 states and 1411 transitions. Second operand 8 states. [2018-11-18 10:08:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:34,853 INFO L93 Difference]: Finished difference Result 1122 states and 1423 transitions. [2018-11-18 10:08:34,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:08:34,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-18 10:08:34,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:34,857 INFO L225 Difference]: With dead ends: 1122 [2018-11-18 10:08:34,857 INFO L226 Difference]: Without dead ends: 1090 [2018-11-18 10:08:34,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-11-18 10:08:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2018-11-18 10:08:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-11-18 10:08:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1387 transitions. [2018-11-18 10:08:34,939 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1387 transitions. Word has length 55 [2018-11-18 10:08:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:34,939 INFO L480 AbstractCegarLoop]: Abstraction has 1090 states and 1387 transitions. [2018-11-18 10:08:34,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:08:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1387 transitions. [2018-11-18 10:08:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 10:08:34,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:34,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:34,942 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:34,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:34,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1022371571, now seen corresponding path program 1 times [2018-11-18 10:08:34,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:34,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:34,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:34,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:34,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:35,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:35,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:08:35,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:08:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:08:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:08:35,025 INFO L87 Difference]: Start difference. First operand 1090 states and 1387 transitions. Second operand 4 states. [2018-11-18 10:08:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:35,200 INFO L93 Difference]: Finished difference Result 1523 states and 1879 transitions. [2018-11-18 10:08:35,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:08:35,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-18 10:08:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:35,203 INFO L225 Difference]: With dead ends: 1523 [2018-11-18 10:08:35,203 INFO L226 Difference]: Without dead ends: 877 [2018-11-18 10:08:35,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:08:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-18 10:08:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 798. [2018-11-18 10:08:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-11-18 10:08:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 983 transitions. [2018-11-18 10:08:35,243 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 983 transitions. Word has length 64 [2018-11-18 10:08:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:35,243 INFO L480 AbstractCegarLoop]: Abstraction has 798 states and 983 transitions. [2018-11-18 10:08:35,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:08:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 983 transitions. [2018-11-18 10:08:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 10:08:35,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:35,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:35,245 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:35,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1446018293, now seen corresponding path program 1 times [2018-11-18 10:08:35,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:35,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:35,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:35,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:35,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:35,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:35,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:35,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:35,322 INFO L87 Difference]: Start difference. First operand 798 states and 983 transitions. Second operand 5 states. [2018-11-18 10:08:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:35,366 INFO L93 Difference]: Finished difference Result 1059 states and 1320 transitions. [2018-11-18 10:08:35,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:35,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-18 10:08:35,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:35,369 INFO L225 Difference]: With dead ends: 1059 [2018-11-18 10:08:35,369 INFO L226 Difference]: Without dead ends: 730 [2018-11-18 10:08:35,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-11-18 10:08:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2018-11-18 10:08:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-18 10:08:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 888 transitions. [2018-11-18 10:08:35,408 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 888 transitions. Word has length 64 [2018-11-18 10:08:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:35,408 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 888 transitions. [2018-11-18 10:08:35,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 888 transitions. [2018-11-18 10:08:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 10:08:35,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:35,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:35,410 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:35,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1560522320, now seen corresponding path program 1 times [2018-11-18 10:08:35,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:35,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:35,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:35,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 10:08:35,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:08:35,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:08:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:08:35,473 INFO L87 Difference]: Start difference. First operand 730 states and 888 transitions. Second operand 8 states. [2018-11-18 10:08:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:35,578 INFO L93 Difference]: Finished difference Result 744 states and 901 transitions. [2018-11-18 10:08:35,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:08:35,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-18 10:08:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:35,581 INFO L225 Difference]: With dead ends: 744 [2018-11-18 10:08:35,581 INFO L226 Difference]: Without dead ends: 726 [2018-11-18 10:08:35,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-11-18 10:08:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2018-11-18 10:08:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-18 10:08:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 882 transitions. [2018-11-18 10:08:35,636 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 882 transitions. Word has length 58 [2018-11-18 10:08:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:35,636 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 882 transitions. [2018-11-18 10:08:35,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:08:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 882 transitions. [2018-11-18 10:08:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 10:08:35,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:35,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:35,638 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:35,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash 799621147, now seen corresponding path program 1 times [2018-11-18 10:08:35,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:35,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:35,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:35,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:08:35,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:08:35,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:08:35,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:35,689 INFO L87 Difference]: Start difference. First operand 726 states and 882 transitions. Second operand 6 states. [2018-11-18 10:08:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:35,742 INFO L93 Difference]: Finished difference Result 745 states and 900 transitions. [2018-11-18 10:08:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:35,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-18 10:08:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:35,745 INFO L225 Difference]: With dead ends: 745 [2018-11-18 10:08:35,745 INFO L226 Difference]: Without dead ends: 707 [2018-11-18 10:08:35,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-18 10:08:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2018-11-18 10:08:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-11-18 10:08:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 859 transitions. [2018-11-18 10:08:35,778 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 859 transitions. Word has length 60 [2018-11-18 10:08:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:35,778 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 859 transitions. [2018-11-18 10:08:35,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:08:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 859 transitions. [2018-11-18 10:08:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 10:08:35,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:35,780 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:35,780 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:35,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1064701422, now seen corresponding path program 1 times [2018-11-18 10:08:35,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:35,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:35,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:35,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:35,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:35,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:35,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:35,825 INFO L87 Difference]: Start difference. First operand 707 states and 859 transitions. Second operand 5 states. [2018-11-18 10:08:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:36,011 INFO L93 Difference]: Finished difference Result 968 states and 1189 transitions. [2018-11-18 10:08:36,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:36,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-18 10:08:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:36,013 INFO L225 Difference]: With dead ends: 968 [2018-11-18 10:08:36,013 INFO L226 Difference]: Without dead ends: 707 [2018-11-18 10:08:36,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-18 10:08:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2018-11-18 10:08:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-11-18 10:08:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 857 transitions. [2018-11-18 10:08:36,047 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 857 transitions. Word has length 68 [2018-11-18 10:08:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:36,047 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 857 transitions. [2018-11-18 10:08:36,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 857 transitions. [2018-11-18 10:08:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 10:08:36,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:36,049 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:36,049 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:36,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:36,049 INFO L82 PathProgramCache]: Analyzing trace with hash 487854810, now seen corresponding path program 1 times [2018-11-18 10:08:36,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:36,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:36,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:36,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:36,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:36,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:36,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:36,085 INFO L87 Difference]: Start difference. First operand 707 states and 857 transitions. Second operand 5 states. [2018-11-18 10:08:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:36,125 INFO L93 Difference]: Finished difference Result 836 states and 1007 transitions. [2018-11-18 10:08:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:36,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-18 10:08:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:36,128 INFO L225 Difference]: With dead ends: 836 [2018-11-18 10:08:36,128 INFO L226 Difference]: Without dead ends: 719 [2018-11-18 10:08:36,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-11-18 10:08:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 715. [2018-11-18 10:08:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-18 10:08:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 865 transitions. [2018-11-18 10:08:36,163 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 865 transitions. Word has length 63 [2018-11-18 10:08:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:36,163 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 865 transitions. [2018-11-18 10:08:36,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 865 transitions. [2018-11-18 10:08:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 10:08:36,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:36,165 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:36,165 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:36,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1527314919, now seen corresponding path program 1 times [2018-11-18 10:08:36,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:36,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:36,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:36,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:36,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:36,219 INFO L87 Difference]: Start difference. First operand 715 states and 865 transitions. Second operand 9 states. [2018-11-18 10:08:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:36,282 INFO L93 Difference]: Finished difference Result 867 states and 1036 transitions. [2018-11-18 10:08:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:36,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-18 10:08:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:36,284 INFO L225 Difference]: With dead ends: 867 [2018-11-18 10:08:36,284 INFO L226 Difference]: Without dead ends: 708 [2018-11-18 10:08:36,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-11-18 10:08:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-11-18 10:08:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-11-18 10:08:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 855 transitions. [2018-11-18 10:08:36,317 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 855 transitions. Word has length 63 [2018-11-18 10:08:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:36,317 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 855 transitions. [2018-11-18 10:08:36,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 855 transitions. [2018-11-18 10:08:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 10:08:36,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:36,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:36,319 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:36,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1486367283, now seen corresponding path program 1 times [2018-11-18 10:08:36,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:36,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:36,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:36,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:08:36,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:08:36,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:08:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:36,353 INFO L87 Difference]: Start difference. First operand 708 states and 855 transitions. Second operand 3 states. [2018-11-18 10:08:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:36,394 INFO L93 Difference]: Finished difference Result 1011 states and 1239 transitions. [2018-11-18 10:08:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:08:36,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-18 10:08:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:36,396 INFO L225 Difference]: With dead ends: 1011 [2018-11-18 10:08:36,396 INFO L226 Difference]: Without dead ends: 750 [2018-11-18 10:08:36,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:08:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-11-18 10:08:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 708. [2018-11-18 10:08:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-11-18 10:08:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 855 transitions. [2018-11-18 10:08:36,431 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 855 transitions. Word has length 71 [2018-11-18 10:08:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:36,431 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 855 transitions. [2018-11-18 10:08:36,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:08:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 855 transitions. [2018-11-18 10:08:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 10:08:36,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:36,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:36,433 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:36,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash 507667981, now seen corresponding path program 1 times [2018-11-18 10:08:36,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:36,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:36,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:36,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:36,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:36,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:08:36,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:08:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:08:36,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:36,484 INFO L87 Difference]: Start difference. First operand 708 states and 855 transitions. Second operand 6 states. [2018-11-18 10:08:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:36,551 INFO L93 Difference]: Finished difference Result 979 states and 1192 transitions. [2018-11-18 10:08:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:36,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-18 10:08:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:36,553 INFO L225 Difference]: With dead ends: 979 [2018-11-18 10:08:36,554 INFO L226 Difference]: Without dead ends: 751 [2018-11-18 10:08:36,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-11-18 10:08:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 708. [2018-11-18 10:08:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-11-18 10:08:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 853 transitions. [2018-11-18 10:08:36,587 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 853 transitions. Word has length 71 [2018-11-18 10:08:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:36,587 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 853 transitions. [2018-11-18 10:08:36,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:08:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 853 transitions. [2018-11-18 10:08:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 10:08:36,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:36,588 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:36,589 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:36,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash -770762414, now seen corresponding path program 1 times [2018-11-18 10:08:36,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:36,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:36,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:36,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:36,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:36,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:36,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:36,640 INFO L87 Difference]: Start difference. First operand 708 states and 853 transitions. Second operand 9 states. [2018-11-18 10:08:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:36,762 INFO L93 Difference]: Finished difference Result 725 states and 869 transitions. [2018-11-18 10:08:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:36,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-18 10:08:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:36,765 INFO L225 Difference]: With dead ends: 725 [2018-11-18 10:08:36,765 INFO L226 Difference]: Without dead ends: 704 [2018-11-18 10:08:36,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-11-18 10:08:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2018-11-18 10:08:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-11-18 10:08:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 847 transitions. [2018-11-18 10:08:36,804 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 847 transitions. Word has length 63 [2018-11-18 10:08:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:36,804 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 847 transitions. [2018-11-18 10:08:36,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 847 transitions. [2018-11-18 10:08:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 10:08:36,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:36,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:36,806 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:36,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash 750429482, now seen corresponding path program 1 times [2018-11-18 10:08:36,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:36,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:36,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:36,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:36,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:36,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:36,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:36,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:36,865 INFO L87 Difference]: Start difference. First operand 704 states and 847 transitions. Second operand 9 states. [2018-11-18 10:08:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:37,001 INFO L93 Difference]: Finished difference Result 721 states and 863 transitions. [2018-11-18 10:08:37,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:37,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-18 10:08:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:37,003 INFO L225 Difference]: With dead ends: 721 [2018-11-18 10:08:37,004 INFO L226 Difference]: Without dead ends: 699 [2018-11-18 10:08:37,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-11-18 10:08:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2018-11-18 10:08:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-11-18 10:08:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 840 transitions. [2018-11-18 10:08:37,055 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 840 transitions. Word has length 64 [2018-11-18 10:08:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:37,055 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 840 transitions. [2018-11-18 10:08:37,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 840 transitions. [2018-11-18 10:08:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 10:08:37,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:37,056 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:37,056 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:37,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:37,057 INFO L82 PathProgramCache]: Analyzing trace with hash -179681988, now seen corresponding path program 1 times [2018-11-18 10:08:37,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:37,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:37,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:37,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:37,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:37,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:37,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:37,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:37,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:37,099 INFO L87 Difference]: Start difference. First operand 699 states and 840 transitions. Second operand 9 states. [2018-11-18 10:08:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:37,211 INFO L93 Difference]: Finished difference Result 716 states and 856 transitions. [2018-11-18 10:08:37,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:37,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-18 10:08:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:37,214 INFO L225 Difference]: With dead ends: 716 [2018-11-18 10:08:37,214 INFO L226 Difference]: Without dead ends: 695 [2018-11-18 10:08:37,214 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-18 10:08:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2018-11-18 10:08:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-11-18 10:08:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 834 transitions. [2018-11-18 10:08:37,246 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 834 transitions. Word has length 64 [2018-11-18 10:08:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:37,246 INFO L480 AbstractCegarLoop]: Abstraction has 695 states and 834 transitions. [2018-11-18 10:08:37,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 834 transitions. [2018-11-18 10:08:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 10:08:37,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:37,247 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:37,247 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:37,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash -796698632, now seen corresponding path program 1 times [2018-11-18 10:08:37,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:37,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:37,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:37,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:37,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 10:08:37,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:08:37,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:08:37,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:08:37,296 INFO L87 Difference]: Start difference. First operand 695 states and 834 transitions. Second operand 8 states. [2018-11-18 10:08:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:37,388 INFO L93 Difference]: Finished difference Result 706 states and 844 transitions. [2018-11-18 10:08:37,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:08:37,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-11-18 10:08:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:37,391 INFO L225 Difference]: With dead ends: 706 [2018-11-18 10:08:37,391 INFO L226 Difference]: Without dead ends: 670 [2018-11-18 10:08:37,391 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-18 10:08:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-11-18 10:08:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-18 10:08:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 804 transitions. [2018-11-18 10:08:37,422 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 804 transitions. Word has length 64 [2018-11-18 10:08:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:37,422 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 804 transitions. [2018-11-18 10:08:37,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:08:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 804 transitions. [2018-11-18 10:08:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 10:08:37,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:37,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:37,424 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:37,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2130115401, now seen corresponding path program 1 times [2018-11-18 10:08:37,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:37,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:37,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:37,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:37,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:37,493 INFO L87 Difference]: Start difference. First operand 670 states and 804 transitions. Second operand 5 states. [2018-11-18 10:08:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:37,746 INFO L93 Difference]: Finished difference Result 1042 states and 1264 transitions. [2018-11-18 10:08:37,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:37,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-18 10:08:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:37,749 INFO L225 Difference]: With dead ends: 1042 [2018-11-18 10:08:37,750 INFO L226 Difference]: Without dead ends: 787 [2018-11-18 10:08:37,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:08:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-18 10:08:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 745. [2018-11-18 10:08:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-18 10:08:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 899 transitions. [2018-11-18 10:08:37,790 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 899 transitions. Word has length 70 [2018-11-18 10:08:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:37,790 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 899 transitions. [2018-11-18 10:08:37,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 899 transitions. [2018-11-18 10:08:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 10:08:37,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:37,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:37,792 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:37,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:37,792 INFO L82 PathProgramCache]: Analyzing trace with hash 559865067, now seen corresponding path program 1 times [2018-11-18 10:08:37,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:37,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:37,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:37,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:37,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:37,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:37,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:37,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:37,839 INFO L87 Difference]: Start difference. First operand 745 states and 899 transitions. Second operand 9 states. [2018-11-18 10:08:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:37,959 INFO L93 Difference]: Finished difference Result 762 states and 915 transitions. [2018-11-18 10:08:37,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:37,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-18 10:08:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:37,962 INFO L225 Difference]: With dead ends: 762 [2018-11-18 10:08:37,962 INFO L226 Difference]: Without dead ends: 719 [2018-11-18 10:08:37,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-11-18 10:08:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2018-11-18 10:08:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-11-18 10:08:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 867 transitions. [2018-11-18 10:08:38,001 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 867 transitions. Word has length 68 [2018-11-18 10:08:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:38,001 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 867 transitions. [2018-11-18 10:08:38,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 867 transitions. [2018-11-18 10:08:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 10:08:38,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:38,003 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:38,003 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:38,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash -552557536, now seen corresponding path program 1 times [2018-11-18 10:08:38,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:38,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:38,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:38,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:38,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:38,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:38,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:08:38,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:08:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:08:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:38,054 INFO L87 Difference]: Start difference. First operand 719 states and 867 transitions. Second operand 7 states. [2018-11-18 10:08:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:38,515 INFO L93 Difference]: Finished difference Result 1026 states and 1247 transitions. [2018-11-18 10:08:38,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:08:38,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-18 10:08:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:38,518 INFO L225 Difference]: With dead ends: 1026 [2018-11-18 10:08:38,518 INFO L226 Difference]: Without dead ends: 714 [2018-11-18 10:08:38,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:08:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-18 10:08:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 703. [2018-11-18 10:08:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-11-18 10:08:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 842 transitions. [2018-11-18 10:08:38,556 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 842 transitions. Word has length 82 [2018-11-18 10:08:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:38,556 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 842 transitions. [2018-11-18 10:08:38,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:08:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 842 transitions. [2018-11-18 10:08:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 10:08:38,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:38,558 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:38,558 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:38,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:38,558 INFO L82 PathProgramCache]: Analyzing trace with hash -207305743, now seen corresponding path program 1 times [2018-11-18 10:08:38,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:38,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:38,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:38,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:38,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:38,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:38,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:38,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:38,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:38,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:38,596 INFO L87 Difference]: Start difference. First operand 703 states and 842 transitions. Second operand 5 states. [2018-11-18 10:08:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:38,662 INFO L93 Difference]: Finished difference Result 828 states and 984 transitions. [2018-11-18 10:08:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:38,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-18 10:08:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:38,665 INFO L225 Difference]: With dead ends: 828 [2018-11-18 10:08:38,665 INFO L226 Difference]: Without dead ends: 701 [2018-11-18 10:08:38,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-11-18 10:08:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2018-11-18 10:08:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-11-18 10:08:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 838 transitions. [2018-11-18 10:08:38,702 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 838 transitions. Word has length 76 [2018-11-18 10:08:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:38,702 INFO L480 AbstractCegarLoop]: Abstraction has 701 states and 838 transitions. [2018-11-18 10:08:38,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 838 transitions. [2018-11-18 10:08:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 10:08:38,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:38,704 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:38,704 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:38,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 505610258, now seen corresponding path program 1 times [2018-11-18 10:08:38,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:38,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:38,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:38,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:38,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:38,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:38,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:38,775 INFO L87 Difference]: Start difference. First operand 701 states and 838 transitions. Second operand 9 states. [2018-11-18 10:08:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:38,832 INFO L93 Difference]: Finished difference Result 713 states and 850 transitions. [2018-11-18 10:08:38,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:38,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-18 10:08:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:38,834 INFO L225 Difference]: With dead ends: 713 [2018-11-18 10:08:38,834 INFO L226 Difference]: Without dead ends: 627 [2018-11-18 10:08:38,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-18 10:08:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-11-18 10:08:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-18 10:08:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 750 transitions. [2018-11-18 10:08:38,869 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 750 transitions. Word has length 76 [2018-11-18 10:08:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:38,869 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 750 transitions. [2018-11-18 10:08:38,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 750 transitions. [2018-11-18 10:08:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 10:08:38,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:38,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:38,871 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:38,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:38,871 INFO L82 PathProgramCache]: Analyzing trace with hash 3195225, now seen corresponding path program 1 times [2018-11-18 10:08:38,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:38,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:38,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:38,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:38,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:38,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:38,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:08:38,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:08:38,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:08:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:38,932 INFO L87 Difference]: Start difference. First operand 627 states and 750 transitions. Second operand 6 states. [2018-11-18 10:08:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:38,988 INFO L93 Difference]: Finished difference Result 960 states and 1179 transitions. [2018-11-18 10:08:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:38,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-18 10:08:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:38,990 INFO L225 Difference]: With dead ends: 960 [2018-11-18 10:08:38,990 INFO L226 Difference]: Without dead ends: 703 [2018-11-18 10:08:38,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-11-18 10:08:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 593. [2018-11-18 10:08:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-11-18 10:08:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 706 transitions. [2018-11-18 10:08:39,024 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 706 transitions. Word has length 83 [2018-11-18 10:08:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:39,024 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 706 transitions. [2018-11-18 10:08:39,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:08:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 706 transitions. [2018-11-18 10:08:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 10:08:39,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:39,025 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:39,025 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:39,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1044142237, now seen corresponding path program 1 times [2018-11-18 10:08:39,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:39,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:39,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:39,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:39,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:39,065 INFO L87 Difference]: Start difference. First operand 593 states and 706 transitions. Second operand 5 states. [2018-11-18 10:08:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:39,305 INFO L93 Difference]: Finished difference Result 1033 states and 1210 transitions. [2018-11-18 10:08:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:39,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-18 10:08:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:39,308 INFO L225 Difference]: With dead ends: 1033 [2018-11-18 10:08:39,308 INFO L226 Difference]: Without dead ends: 641 [2018-11-18 10:08:39,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-11-18 10:08:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 618. [2018-11-18 10:08:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-18 10:08:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 721 transitions. [2018-11-18 10:08:39,343 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 721 transitions. Word has length 78 [2018-11-18 10:08:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:39,344 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 721 transitions. [2018-11-18 10:08:39,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 721 transitions. [2018-11-18 10:08:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 10:08:39,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:39,345 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:39,345 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:39,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash -796576949, now seen corresponding path program 1 times [2018-11-18 10:08:39,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:39,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:39,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:39,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:39,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:39,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:39,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:39,394 INFO L87 Difference]: Start difference. First operand 618 states and 721 transitions. Second operand 9 states. [2018-11-18 10:08:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:39,492 INFO L93 Difference]: Finished difference Result 620 states and 722 transitions. [2018-11-18 10:08:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:39,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-18 10:08:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:39,494 INFO L225 Difference]: With dead ends: 620 [2018-11-18 10:08:39,494 INFO L226 Difference]: Without dead ends: 453 [2018-11-18 10:08:39,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-11-18 10:08:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-11-18 10:08:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-11-18 10:08:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 537 transitions. [2018-11-18 10:08:39,522 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 537 transitions. Word has length 81 [2018-11-18 10:08:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:39,522 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 537 transitions. [2018-11-18 10:08:39,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 537 transitions. [2018-11-18 10:08:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 10:08:39,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:39,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:39,523 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:39,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash -138819064, now seen corresponding path program 1 times [2018-11-18 10:08:39,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:39,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:39,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:39,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:39,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:39,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:39,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:39,584 INFO L87 Difference]: Start difference. First operand 453 states and 537 transitions. Second operand 9 states. [2018-11-18 10:08:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:39,660 INFO L93 Difference]: Finished difference Result 474 states and 558 transitions. [2018-11-18 10:08:39,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:39,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-18 10:08:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:39,663 INFO L225 Difference]: With dead ends: 474 [2018-11-18 10:08:39,663 INFO L226 Difference]: Without dead ends: 453 [2018-11-18 10:08:39,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:08:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-11-18 10:08:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-11-18 10:08:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-11-18 10:08:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 536 transitions. [2018-11-18 10:08:39,690 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 536 transitions. Word has length 88 [2018-11-18 10:08:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:39,690 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 536 transitions. [2018-11-18 10:08:39,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 536 transitions. [2018-11-18 10:08:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 10:08:39,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:39,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:39,692 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:39,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:39,692 INFO L82 PathProgramCache]: Analyzing trace with hash -818160155, now seen corresponding path program 1 times [2018-11-18 10:08:39,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:39,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:39,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:39,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:08:39,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:08:39,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:08:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:39,732 INFO L87 Difference]: Start difference. First operand 453 states and 536 transitions. Second operand 7 states. [2018-11-18 10:08:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:39,849 INFO L93 Difference]: Finished difference Result 855 states and 1015 transitions. [2018-11-18 10:08:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:39,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-18 10:08:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:39,852 INFO L225 Difference]: With dead ends: 855 [2018-11-18 10:08:39,852 INFO L226 Difference]: Without dead ends: 800 [2018-11-18 10:08:39,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-11-18 10:08:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 373. [2018-11-18 10:08:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 10:08:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 434 transitions. [2018-11-18 10:08:39,882 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 434 transitions. Word has length 99 [2018-11-18 10:08:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:39,882 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 434 transitions. [2018-11-18 10:08:39,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:08:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 434 transitions. [2018-11-18 10:08:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 10:08:39,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:39,883 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:39,883 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:39,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:39,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1511697420, now seen corresponding path program 1 times [2018-11-18 10:08:39,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:39,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:08:39,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:39,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:08:39,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:08:39,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:08:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:39,960 INFO L87 Difference]: Start difference. First operand 373 states and 434 transitions. Second operand 11 states. [2018-11-18 10:08:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:40,052 INFO L93 Difference]: Finished difference Result 520 states and 608 transitions. [2018-11-18 10:08:40,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:08:40,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2018-11-18 10:08:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:40,054 INFO L225 Difference]: With dead ends: 520 [2018-11-18 10:08:40,054 INFO L226 Difference]: Without dead ends: 369 [2018-11-18 10:08:40,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:08:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-18 10:08:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 356. [2018-11-18 10:08:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-18 10:08:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 411 transitions. [2018-11-18 10:08:40,088 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 411 transitions. Word has length 104 [2018-11-18 10:08:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:40,088 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 411 transitions. [2018-11-18 10:08:40,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:08:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 411 transitions. [2018-11-18 10:08:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 10:08:40,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:40,090 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:40,090 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:40,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1019545780, now seen corresponding path program 1 times [2018-11-18 10:08:40,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:40,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:08:40,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:40,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:08:40,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:08:40,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:08:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:40,199 INFO L87 Difference]: Start difference. First operand 356 states and 411 transitions. Second operand 6 states. [2018-11-18 10:08:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:40,259 INFO L93 Difference]: Finished difference Result 384 states and 437 transitions. [2018-11-18 10:08:40,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:40,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-18 10:08:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:40,261 INFO L225 Difference]: With dead ends: 384 [2018-11-18 10:08:40,261 INFO L226 Difference]: Without dead ends: 307 [2018-11-18 10:08:40,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-18 10:08:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 244. [2018-11-18 10:08:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-18 10:08:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 269 transitions. [2018-11-18 10:08:40,291 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 269 transitions. Word has length 113 [2018-11-18 10:08:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:40,291 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 269 transitions. [2018-11-18 10:08:40,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:08:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 269 transitions. [2018-11-18 10:08:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 10:08:40,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:40,293 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:40,293 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:40,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:40,293 INFO L82 PathProgramCache]: Analyzing trace with hash -960660735, now seen corresponding path program 1 times [2018-11-18 10:08:40,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:40,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:40,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:40,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 10:08:40,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:40,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:40,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:40,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:40,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:40,394 INFO L87 Difference]: Start difference. First operand 244 states and 269 transitions. Second operand 9 states. [2018-11-18 10:08:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:40,509 INFO L93 Difference]: Finished difference Result 318 states and 357 transitions. [2018-11-18 10:08:40,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:40,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-11-18 10:08:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:40,511 INFO L225 Difference]: With dead ends: 318 [2018-11-18 10:08:40,511 INFO L226 Difference]: Without dead ends: 289 [2018-11-18 10:08:40,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-18 10:08:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2018-11-18 10:08:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-18 10:08:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 295 transitions. [2018-11-18 10:08:40,543 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 295 transitions. Word has length 134 [2018-11-18 10:08:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:40,543 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 295 transitions. [2018-11-18 10:08:40,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 295 transitions. [2018-11-18 10:08:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 10:08:40,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:40,544 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:40,544 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:40,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:40,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2119185761, now seen corresponding path program 1 times [2018-11-18 10:08:40,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:40,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 10:08:40,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:40,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:40,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:40,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:40,633 INFO L87 Difference]: Start difference. First operand 265 states and 295 transitions. Second operand 9 states. [2018-11-18 10:08:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:40,732 INFO L93 Difference]: Finished difference Result 341 states and 378 transitions. [2018-11-18 10:08:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:40,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-11-18 10:08:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:40,734 INFO L225 Difference]: With dead ends: 341 [2018-11-18 10:08:40,734 INFO L226 Difference]: Without dead ends: 270 [2018-11-18 10:08:40,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-18 10:08:40,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 247. [2018-11-18 10:08:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-18 10:08:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 270 transitions. [2018-11-18 10:08:40,766 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 270 transitions. Word has length 135 [2018-11-18 10:08:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:40,766 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 270 transitions. [2018-11-18 10:08:40,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 270 transitions. [2018-11-18 10:08:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 10:08:40,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:40,768 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:40,768 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:40,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1763534259, now seen corresponding path program 1 times [2018-11-18 10:08:40,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:40,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 10:08:40,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:40,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:08:40,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:08:40,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:08:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:40,841 INFO L87 Difference]: Start difference. First operand 247 states and 270 transitions. Second operand 5 states. [2018-11-18 10:08:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:40,878 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-11-18 10:08:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:08:40,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-18 10:08:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:40,881 INFO L225 Difference]: With dead ends: 283 [2018-11-18 10:08:40,881 INFO L226 Difference]: Without dead ends: 253 [2018-11-18 10:08:40,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:08:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-18 10:08:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2018-11-18 10:08:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-18 10:08:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 274 transitions. [2018-11-18 10:08:40,914 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 274 transitions. Word has length 151 [2018-11-18 10:08:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:40,915 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 274 transitions. [2018-11-18 10:08:40,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:08:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 274 transitions. [2018-11-18 10:08:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 10:08:40,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:40,916 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:40,916 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:40,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1945020756, now seen corresponding path program 1 times [2018-11-18 10:08:40,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:40,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:40,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:40,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 10:08:41,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:41,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 10:08:41,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 10:08:41,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 10:08:41,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:08:41,092 INFO L87 Difference]: Start difference. First operand 251 states and 274 transitions. Second operand 15 states. [2018-11-18 10:08:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:41,247 INFO L93 Difference]: Finished difference Result 318 states and 354 transitions. [2018-11-18 10:08:41,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 10:08:41,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 151 [2018-11-18 10:08:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:41,248 INFO L225 Difference]: With dead ends: 318 [2018-11-18 10:08:41,248 INFO L226 Difference]: Without dead ends: 283 [2018-11-18 10:08:41,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:08:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-18 10:08:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2018-11-18 10:08:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-18 10:08:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 295 transitions. [2018-11-18 10:08:41,276 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 295 transitions. Word has length 151 [2018-11-18 10:08:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:41,276 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 295 transitions. [2018-11-18 10:08:41,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 10:08:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 295 transitions. [2018-11-18 10:08:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 10:08:41,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:41,277 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:41,277 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:41,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1201404660, now seen corresponding path program 1 times [2018-11-18 10:08:41,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:41,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:41,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:41,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:41,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:08:41,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:41,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:08:41,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:08:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:08:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:08:41,360 INFO L87 Difference]: Start difference. First operand 268 states and 295 transitions. Second operand 9 states. [2018-11-18 10:08:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:41,436 INFO L93 Difference]: Finished difference Result 359 states and 397 transitions. [2018-11-18 10:08:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:08:41,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2018-11-18 10:08:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:41,438 INFO L225 Difference]: With dead ends: 359 [2018-11-18 10:08:41,438 INFO L226 Difference]: Without dead ends: 276 [2018-11-18 10:08:41,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:08:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-18 10:08:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 268. [2018-11-18 10:08:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-18 10:08:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 294 transitions. [2018-11-18 10:08:41,470 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 294 transitions. Word has length 152 [2018-11-18 10:08:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:41,471 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 294 transitions. [2018-11-18 10:08:41,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:08:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 294 transitions. [2018-11-18 10:08:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 10:08:41,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:41,472 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:41,472 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:41,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash -552499366, now seen corresponding path program 1 times [2018-11-18 10:08:41,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:41,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:41,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 10:08:41,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:08:41,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:08:41,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:41,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 10:08:41,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:08:41,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-11-18 10:08:41,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 10:08:41,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 10:08:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:08:41,936 INFO L87 Difference]: Start difference. First operand 268 states and 294 transitions. Second operand 21 states. [2018-11-18 10:08:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:42,138 INFO L93 Difference]: Finished difference Result 314 states and 346 transitions. [2018-11-18 10:08:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:08:42,138 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2018-11-18 10:08:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:42,139 INFO L225 Difference]: With dead ends: 314 [2018-11-18 10:08:42,139 INFO L226 Difference]: Without dead ends: 273 [2018-11-18 10:08:42,140 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-11-18 10:08:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-18 10:08:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 262. [2018-11-18 10:08:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-18 10:08:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2018-11-18 10:08:42,179 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 153 [2018-11-18 10:08:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:42,180 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2018-11-18 10:08:42,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 10:08:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2018-11-18 10:08:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 10:08:42,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:42,181 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:42,181 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:42,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1980614348, now seen corresponding path program 1 times [2018-11-18 10:08:42,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:42,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:42,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:42,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:42,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 10:08:42,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:08:42,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:08:42,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:42,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 10:08:42,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:08:42,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-18 10:08:42,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:08:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:08:42,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:08:42,462 INFO L87 Difference]: Start difference. First operand 262 states and 285 transitions. Second operand 14 states. [2018-11-18 10:08:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:42,607 INFO L93 Difference]: Finished difference Result 324 states and 350 transitions. [2018-11-18 10:08:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:08:42,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2018-11-18 10:08:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:42,609 INFO L225 Difference]: With dead ends: 324 [2018-11-18 10:08:42,609 INFO L226 Difference]: Without dead ends: 247 [2018-11-18 10:08:42,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-18 10:08:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-18 10:08:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2018-11-18 10:08:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-18 10:08:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 250 transitions. [2018-11-18 10:08:42,633 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 250 transitions. Word has length 159 [2018-11-18 10:08:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:42,633 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 250 transitions. [2018-11-18 10:08:42,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:08:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 250 transitions. [2018-11-18 10:08:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 10:08:42,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:42,634 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:42,634 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:42,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1087506197, now seen corresponding path program 1 times [2018-11-18 10:08:42,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:42,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:42,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 10:08:42,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:42,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:08:42,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:08:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:08:42,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:08:42,692 INFO L87 Difference]: Start difference. First operand 233 states and 250 transitions. Second operand 6 states. [2018-11-18 10:08:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:42,726 INFO L93 Difference]: Finished difference Result 324 states and 348 transitions. [2018-11-18 10:08:42,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:08:42,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-11-18 10:08:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:42,728 INFO L225 Difference]: With dead ends: 324 [2018-11-18 10:08:42,729 INFO L226 Difference]: Without dead ends: 238 [2018-11-18 10:08:42,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:08:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-18 10:08:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2018-11-18 10:08:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-18 10:08:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 248 transitions. [2018-11-18 10:08:42,751 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 248 transitions. Word has length 161 [2018-11-18 10:08:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:42,751 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 248 transitions. [2018-11-18 10:08:42,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:08:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 248 transitions. [2018-11-18 10:08:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 10:08:42,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:42,752 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:42,753 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:42,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1950494539, now seen corresponding path program 1 times [2018-11-18 10:08:42,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:42,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:42,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:42,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 10:08:42,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:08:42,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 10:08:42,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:08:42,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:08:42,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:08:42,838 INFO L87 Difference]: Start difference. First operand 232 states and 248 transitions. Second operand 10 states. [2018-11-18 10:08:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:43,253 INFO L93 Difference]: Finished difference Result 458 states and 491 transitions. [2018-11-18 10:08:43,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 10:08:43,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 162 [2018-11-18 10:08:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:43,255 INFO L225 Difference]: With dead ends: 458 [2018-11-18 10:08:43,255 INFO L226 Difference]: Without dead ends: 235 [2018-11-18 10:08:43,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-11-18 10:08:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-18 10:08:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-11-18 10:08:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-18 10:08:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 247 transitions. [2018-11-18 10:08:43,274 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 247 transitions. Word has length 162 [2018-11-18 10:08:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:43,274 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 247 transitions. [2018-11-18 10:08:43,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:08:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 247 transitions. [2018-11-18 10:08:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 10:08:43,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:08:43,275 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:08:43,276 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:08:43,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:08:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash -503913673, now seen corresponding path program 1 times [2018-11-18 10:08:43,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:08:43,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:08:43,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:43,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:08:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 10:08:43,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:08:43,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:08:43,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:08:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:08:43,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:08:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:08:43,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:08:43,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-11-18 10:08:43,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 10:08:43,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 10:08:43,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-18 10:08:43,569 INFO L87 Difference]: Start difference. First operand 232 states and 247 transitions. Second operand 19 states. [2018-11-18 10:08:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:08:44,328 INFO L93 Difference]: Finished difference Result 304 states and 327 transitions. [2018-11-18 10:08:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 10:08:44,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 162 [2018-11-18 10:08:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:08:44,329 INFO L225 Difference]: With dead ends: 304 [2018-11-18 10:08:44,329 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:08:44,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 10:08:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:08:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:08:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:08:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:08:44,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2018-11-18 10:08:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:08:44,331 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:08:44,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 10:08:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:08:44,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:08:44,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:08:44,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:44,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:44,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:44,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:45,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:46,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:46,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:46,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:46,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:46,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:46,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:46,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:08:46,528 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-18 10:08:46,790 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 79 [2018-11-18 10:08:46,925 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 66 [2018-11-18 10:08:47,043 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2018-11-18 10:08:47,193 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2018-11-18 10:08:47,459 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 82 [2018-11-18 10:08:47,688 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2018-11-18 10:08:47,926 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 79 [2018-11-18 10:08:48,357 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 66 [2018-11-18 10:08:48,472 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 1 [2018-11-18 10:08:48,888 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 103 [2018-11-18 10:08:49,565 WARN L180 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 108 [2018-11-18 10:08:50,003 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 79 [2018-11-18 10:08:50,123 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-18 10:08:50,563 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 102 [2018-11-18 10:08:50,816 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 79 [2018-11-18 10:08:50,995 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 62 [2018-11-18 10:08:51,175 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 1 [2018-11-18 10:08:51,338 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 81 [2018-11-18 10:08:51,859 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 105 [2018-11-18 10:08:52,196 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2018-11-18 10:08:52,330 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-18 10:08:52,826 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 85 [2018-11-18 10:08:52,944 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-18 10:08:53,809 WARN L180 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 117 [2018-11-18 10:08:53,979 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2018-11-18 10:08:54,344 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 91 [2018-11-18 10:08:54,721 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2018-11-18 10:08:55,074 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 94 [2018-11-18 10:08:55,350 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 83 [2018-11-18 10:08:55,452 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-18 10:08:55,556 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 1 [2018-11-18 10:08:55,869 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 95 [2018-11-18 10:08:56,000 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-18 10:08:56,189 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2018-11-18 10:08:56,750 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 93 [2018-11-18 10:08:57,078 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 102 [2018-11-18 10:08:57,886 WARN L180 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 114 [2018-11-18 10:08:57,989 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 79 [2018-11-18 10:08:58,223 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 79 [2018-11-18 10:08:58,326 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-18 10:08:58,494 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2018-11-18 10:08:59,083 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 110 [2018-11-18 10:08:59,411 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 79 [2018-11-18 10:08:59,605 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 74 [2018-11-18 10:08:59,800 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2018-11-18 10:08:59,998 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2018-11-18 10:09:00,317 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2018-11-18 10:09:00,758 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 98 [2018-11-18 10:09:01,300 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 102 [2018-11-18 10:09:02,029 WARN L180 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 114 [2018-11-18 10:09:02,226 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2018-11-18 10:09:02,428 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2018-11-18 10:09:02,554 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 85 [2018-11-18 10:09:02,792 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2018-11-18 10:09:02,917 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 74 [2018-11-18 10:09:03,036 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2018-11-18 10:09:03,193 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 74 [2018-11-18 10:09:03,302 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2018-11-18 10:09:03,659 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2018-11-18 10:09:04,022 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-11-18 10:09:04,438 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2018-11-18 10:09:04,679 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-18 10:09:04,783 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 58 [2018-11-18 10:09:05,003 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2018-11-18 10:09:05,484 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2018-11-18 10:09:05,564 INFO L425 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 908 929) no Hoare annotation was computed. [2018-11-18 10:09:05,564 INFO L425 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2018-11-18 10:09:05,564 INFO L428 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2018-11-18 10:09:05,564 INFO L428 ceAbstractionStarter]: At program point L918(lines 917 927) the Hoare annotation is: true [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 919 926) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L428 ceAbstractionStarter]: At program point L916(lines 915 927) the Hoare annotation is: true [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 927) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 919 926) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 66 86) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 66 86) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (< 0 ~MaximumInterfaceType~0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< ~PagingReferenceCount~0 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 ~PagingReferenceCount~0) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L428 ceAbstractionStarter]: At program point L939(lines 938 948) the Hoare annotation is: true [2018-11-18 10:09:05,565 INFO L428 ceAbstractionStarter]: At program point L937(lines 936 948) the Hoare annotation is: true [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point L936(lines 936 948) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L428 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 940 947) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 930 950) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 940 947) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 646 652) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsENTRY(lines 646 652) no Hoare annotation was computed. [2018-11-18 10:09:05,565 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 646 652) no Hoare annotation was computed. [2018-11-18 10:09:05,566 INFO L421 ceAbstractionStarter]: At program point L225(lines 224 419) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= 1 ~s~0) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2)))) [2018-11-18 10:09:05,566 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-11-18 10:09:05,566 INFO L425 ceAbstractionStarter]: For program point L192-2(lines 192 194) no Hoare annotation was computed. [2018-11-18 10:09:05,566 INFO L421 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (let ((.cse21 (+ ~DC~0 2)) (.cse22 (+ ~SKIP1~0 2)) (.cse23 (+ ~DC~0 5))) (let ((.cse4 (<= .cse23 ~IPC~0)) (.cse5 (= 0 ~pended~0)) (.cse6 (<= ~PagingReferenceCount~0 1)) (.cse7 (= 0 ~customIrp~0)) (.cse8 (= 0 ~myStatus~0)) (.cse9 (<= ~MPR3~0 6)) (.cse10 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (<= 1 ~setEventCalled~0)) (.cse12 (<= 6 ~MPR3~0)) (.cse14 (<= FloppyPnp_~__cil_tmp30~0 259)) (.cse15 (<= .cse22 ~MPR1~0)) (.cse16 (<= 1 ~compRegistered~0)) (.cse17 (<= 259 FloppyPnp_~__cil_tmp30~0)) (.cse18 (<= .cse21 ~SKIP2~0)) (.cse19 (<= ~setEventCalled~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0)) (.cse13 (+ ~NP~0 2))) (let ((.cse0 (or (< ~SKIP1~0 .cse13) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse21) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse22) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse23) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and .cse4 .cse5 .cse6 .cse7 (<= 1 ~s~0) .cse8 (<= ~s~0 1) .cse9 .cse10 .cse11 .cse12 .cse14 (= ~s~0 ~NP~0) (not (= 259 FloppyPnp_~ntStatus~0)) (= |old(~s~0)| ~s~0) .cse15 .cse16 .cse17 .cse18 (<= (+ ~s~0 2) ~SKIP1~0) .cse19 .cse20)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (<= 1 ~NP~0) .cse4 .cse5 .cse6 .cse7 (<= ~MPR3~0 ~s~0) .cse8 (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) .cse9 .cse10 .cse11 .cse12 (<= .cse13 ~SKIP1~0) .cse14 .cse15 .cse16 .cse17 (<= ~s~0 ~MPR3~0) .cse18 .cse19 .cse20))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3))))) [2018-11-18 10:09:05,566 INFO L425 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2018-11-18 10:09:05,566 INFO L425 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2018-11-18 10:09:05,566 INFO L425 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2018-11-18 10:09:05,567 INFO L421 ceAbstractionStarter]: At program point L325(line 325) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,567 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2018-11-18 10:09:05,567 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2018-11-18 10:09:05,567 INFO L421 ceAbstractionStarter]: At program point L408(line 408) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,567 INFO L425 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2018-11-18 10:09:05,567 INFO L421 ceAbstractionStarter]: At program point L243(line 243) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,567 INFO L425 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2018-11-18 10:09:05,567 INFO L421 ceAbstractionStarter]: At program point L202(line 202) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse3) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse4 ~SKIP2~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,568 INFO L425 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2018-11-18 10:09:05,568 INFO L425 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2018-11-18 10:09:05,568 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 228 418) no Hoare annotation was computed. [2018-11-18 10:09:05,568 INFO L425 ceAbstractionStarter]: For program point $Ultimate##20(lines 228 418) no Hoare annotation was computed. [2018-11-18 10:09:05,568 INFO L421 ceAbstractionStarter]: At program point L392(lines 392 393) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= .cse3 ~SKIP1~0) (<= 1 ~NP~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (<= .cse5 ~MPR1~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 10:09:05,568 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2018-11-18 10:09:05,568 INFO L425 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2018-11-18 10:09:05,568 INFO L421 ceAbstractionStarter]: At program point L227(lines 226 419) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse0 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse1 .cse0 (not (= |old(~myStatus~0)| 0)) .cse2)))) [2018-11-18 10:09:05,569 INFO L421 ceAbstractionStarter]: At program point L417(lines 228 418) the Hoare annotation is: (let ((.cse29 (+ ~DC~0 2)) (.cse31 (+ ~DC~0 5))) (let ((.cse30 (+ ~SKIP1~0 2)) (.cse28 (+ ~NP~0 2)) (.cse32 (= ~DC~0 ~s~0)) (.cse15 (<= .cse31 ~IPC~0)) (.cse16 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse21 (= 0 ~pended~0)) (.cse18 (<= .cse29 ~SKIP2~0))) (let ((.cse14 (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0))) (.cse20 (<= 1 ~NP~0)) (.cse11 (and .cse32 .cse15 .cse16 .cse21 .cse18)) (.cse13 (= ~NP~0 |old(~s~0)|)) (.cse24 (<= ~MPR3~0 6)) (.cse10 (<= .cse28 ~SKIP1~0)) (.cse26 (<= ~PagingReferenceCount~0 1)) (.cse22 (= ~SKIP2~0 ~s~0)) (.cse12 (<= .cse30 ~MPR1~0)) (.cse23 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse25 (<= ~compRegistered~0 0)) (.cse27 (< 0 ~PagingReferenceCount~0)) (.cse17 (= 0 ~compRegistered~0)) (.cse19 (= ~pended~0 1))) (let ((.cse0 (and .cse32 .cse17 .cse19)) (.cse1 (or (< ~SKIP1~0 .cse28) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse29) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse30) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse31) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and .cse10 .cse15 .cse21 .cse26 .cse22 .cse12 .cse23 .cse16 .cse18 .cse25 .cse27)) (.cse4 (and .cse15 .cse16 (= ~s~0 ~NP~0) .cse17 .cse18 .cse19)) (.cse3 (< 0 ~MaximumInterfaceType~0)) (.cse5 (and .cse10 .cse15 .cse16 .cse17 .cse18 .cse22 .cse19)) (.cse6 (and (and (and .cse20 (and .cse10 .cse11 .cse26 .cse12 .cse13 .cse27)) .cse24) (not (= 259 FloppyPnp_~ntStatus~0)))) (.cse7 (and .cse10 .cse20 .cse15 .cse21 .cse22 .cse12 (= 0 ~customIrp~0) .cse14 .cse23 .cse18 (<= ~NP~0 1) .cse24 (= |old(~customIrp~0)| ~customIrp~0) (not (= |old(~s~0)| ~MPR3~0)) .cse25 (<= 6 ~MPR3~0))) (.cse8 (and .cse15 .cse16 .cse17 .cse18 .cse19 (= ~IPC~0 ~s~0))) (.cse9 (and .cse10 (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) .cse11 .cse12 .cse13 .cse14))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)))))) [2018-11-18 10:09:05,569 INFO L421 ceAbstractionStarter]: At program point L351(line 351) the Hoare annotation is: (let ((.cse11 (+ ~DC~0 2)) (.cse13 (+ ~DC~0 5)) (.cse12 (+ ~SKIP1~0 2))) (let ((.cse4 (and (<= ~PagingReferenceCount~0 1) (<= .cse11 ~SKIP2~0) (and (= 0 ~pended~0) (<= .cse13 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse12 ~MPR1~0) (< 0 ~PagingReferenceCount~0))) (.cse5 (<= ~s~0 1)) (.cse6 (<= ~MPR3~0 6)) (.cse7 (= 0 ~customIrp~0)) (.cse8 (<= 1 ~s~0)) (.cse9 (= |old(~customIrp~0)| ~customIrp~0)) (.cse10 (<= 6 ~MPR3~0))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse11) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse12) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse13) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and .cse4 (not (= 259 FloppyPnp_~ntStatus~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) .cse10)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (= 0 FloppyPnp_~ntStatus~0) .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3))))) [2018-11-18 10:09:05,569 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2018-11-18 10:09:05,569 INFO L421 ceAbstractionStarter]: At program point L219(lines 215 422) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~s~0)| ~s~0) (= 0 FloppyPnp_~ntStatus~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2))) [2018-11-18 10:09:05,569 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2018-11-18 10:09:05,569 INFO L421 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~NP~0) (<= .cse5 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,570 INFO L425 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2018-11-18 10:09:05,570 INFO L421 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (let ((.cse5 (+ ~DC~0 2)) (.cse4 (+ ~SKIP1~0 2)) (.cse3 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse4) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse3) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (= 0 ~customIrp~0) (<= 1 ~s~0) (= 0 ~myStatus~0) (<= ~s~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0) (= ~s~0 ~NP~0) (= |old(~s~0)| ~s~0) (<= .cse4 ~MPR1~0) (<= 1 ~compRegistered~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse5 ~SKIP2~0) (<= (+ ~s~0 2) ~SKIP1~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 10:09:05,570 INFO L425 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2018-11-18 10:09:05,570 INFO L421 ceAbstractionStarter]: At program point L261(lines 261 262) the Hoare annotation is: (let ((.cse4 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse5 (+ ~DC~0 5)) (.cse6 (= 0 ~compRegistered~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse6 (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (or (< ~SKIP1~0 .cse4) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse5) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (<= .cse4 ~SKIP1~0) (<= .cse5 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) .cse6 (<= .cse7 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse8 ~MPR1~0) (= ~pended~0 1)))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3)))) [2018-11-18 10:09:05,570 INFO L425 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2018-11-18 10:09:05,570 INFO L425 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2018-11-18 10:09:05,570 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2018-11-18 10:09:05,571 INFO L421 ceAbstractionStarter]: At program point L369(line 369) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~NP~0) (<= .cse5 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,571 INFO L425 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2018-11-18 10:09:05,571 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2018-11-18 10:09:05,571 INFO L425 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2018-11-18 10:09:05,571 INFO L425 ceAbstractionStarter]: For program point L427-2(lines 427 429) no Hoare annotation was computed. [2018-11-18 10:09:05,571 INFO L421 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,571 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 420) no Hoare annotation was computed. [2018-11-18 10:09:05,571 INFO L421 ceAbstractionStarter]: At program point L213(lines 209 424) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= 1 ~s~0) (<= ~s~0 ~NP~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 10:09:05,572 INFO L421 ceAbstractionStarter]: At program point L304(line 304) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,572 INFO L425 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2018-11-18 10:09:05,572 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2018-11-18 10:09:05,572 INFO L421 ceAbstractionStarter]: At program point L288(line 288) the Hoare annotation is: (let ((.cse6 (+ ~DC~0 2)) (.cse4 (+ ~DC~0 5)) (.cse5 (= 0 ~compRegistered~0))) (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~pended~0) .cse5 (= |old(~s~0)| ~s~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (<= .cse4 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) .cse5 (<= .cse6 ~SKIP2~0) (= ~pended~0 1)))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3)))) [2018-11-18 10:09:05,572 INFO L421 ceAbstractionStarter]: At program point L255(line 255) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= 1 ~s~0) (<= ~s~0 ~NP~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 10:09:05,572 INFO L421 ceAbstractionStarter]: At program point L222(lines 221 420) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse0 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse1 .cse0 (not (= |old(~myStatus~0)| 0)) .cse2)))) [2018-11-18 10:09:05,572 INFO L425 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2018-11-18 10:09:05,573 INFO L421 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse12 (+ ~SKIP1~0 2)) (.cse11 (+ ~DC~0 2)) (.cse13 (+ ~DC~0 5)) (.cse10 (+ ~NP~0 2))) (let ((.cse4 (<= .cse10 ~SKIP1~0)) (.cse5 (<= .cse13 ~IPC~0)) (.cse6 (= 0 ~compRegistered~0)) (.cse9 (<= .cse11 ~SKIP2~0)) (.cse7 (<= .cse12 ~MPR1~0)) (.cse8 (= ~s~0 ~SKIP1~0))) (let ((.cse0 (or (< ~SKIP1~0 .cse10) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse11) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse12) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse13) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and .cse4 .cse5 (<= (+ ~NP~0 5) ~MPR3~0) .cse6 .cse9 .cse7 (= ~pended~0 1) .cse8)) (.cse3 (and .cse4 (<= 1 ~NP~0) .cse5 (= 0 ~pended~0) .cse6 (= |old(~s~0)| ~NP~0) .cse7 .cse8 (= 0 ~customIrp~0) .cse9 (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3))))) [2018-11-18 10:09:05,573 INFO L425 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-18 10:09:05,573 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2018-11-18 10:09:05,573 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2018-11-18 10:09:05,573 INFO L421 ceAbstractionStarter]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,573 INFO L425 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2018-11-18 10:09:05,573 INFO L425 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2018-11-18 10:09:05,573 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-18 10:09:05,573 INFO L425 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-11-18 10:09:05,573 INFO L425 ceAbstractionStarter]: For program point L264-2(lines 264 266) no Hoare annotation was computed. [2018-11-18 10:09:05,574 INFO L421 ceAbstractionStarter]: At program point L388(line 388) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 ~SKIP1~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2))) [2018-11-18 10:09:05,574 INFO L425 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2018-11-18 10:09:05,574 INFO L425 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2018-11-18 10:09:05,574 INFO L421 ceAbstractionStarter]: At program point L380(line 380) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,574 INFO L425 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2018-11-18 10:09:05,574 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2018-11-18 10:09:05,574 INFO L425 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2018-11-18 10:09:05,574 INFO L425 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2018-11-18 10:09:05,574 INFO L421 ceAbstractionStarter]: At program point L207(lines 206 425) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= ~PagingReferenceCount~0 1)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (= |old(~s~0)| ~s~0)) (.cse7 (= 0 FloppyPnp_~ntStatus~0)) (.cse8 (< 0 ~PagingReferenceCount~0)) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse2 .cse3 .cse4 (= |old(~myStatus~0)| ~myStatus~0) .cse5 .cse6 .cse7 .cse8)) (or .cse0 (and .cse2 .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7 .cse8) (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,574 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2018-11-18 10:09:05,575 INFO L425 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2018-11-18 10:09:05,575 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 419) no Hoare annotation was computed. [2018-11-18 10:09:05,575 INFO L421 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~NP~0) (<= .cse5 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,575 INFO L425 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2018-11-18 10:09:05,575 INFO L421 ceAbstractionStarter]: At program point L249(line 249) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~NP~0) (<= .cse5 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,575 INFO L425 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2018-11-18 10:09:05,575 INFO L421 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,575 INFO L425 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2018-11-18 10:09:05,576 INFO L425 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2018-11-18 10:09:05,576 INFO L421 ceAbstractionStarter]: At program point L398(line 398) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= .cse3 ~SKIP1~0) (<= 1 ~NP~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (<= .cse5 ~MPR1~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 10:09:05,576 INFO L425 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2018-11-18 10:09:05,576 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2018-11-18 10:09:05,576 INFO L425 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2018-11-18 10:09:05,576 INFO L421 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 159 432) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= 0 ~PagingReferenceCount~0)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (= |old(~s~0)| ~s~0)) (.cse7 (<= ~PagingReferenceCount~0 0)) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse2 .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6 .cse7)) (or .cse0 (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7) (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,576 INFO L421 ceAbstractionStarter]: At program point L704(line 704) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 ~lowerDriverReturn~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (<= 0 ~PagingReferenceCount~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 main_~status~1) (<= ~PagingReferenceCount~0 0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,576 INFO L425 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2018-11-18 10:09:05,576 INFO L425 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2018-11-18 10:09:05,577 INFO L425 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2018-11-18 10:09:05,577 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2018-11-18 10:09:05,577 INFO L425 ceAbstractionStarter]: For program point L812(lines 812 814) no Hoare annotation was computed. [2018-11-18 10:09:05,577 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2018-11-18 10:09:05,577 INFO L421 ceAbstractionStarter]: At program point L730(lines 729 777) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 main_~status~1)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,577 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-18 10:09:05,577 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2018-11-18 10:09:05,577 INFO L421 ceAbstractionStarter]: At program point L747(lines 746 774) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,577 INFO L425 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2018-11-18 10:09:05,578 INFO L421 ceAbstractionStarter]: At program point L706(lines 700 837) the Hoare annotation is: (let ((.cse7 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse5 (= ~pended~0 1)) (.cse6 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (= 0 ~pended~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (= 0 main_~status~1)) (.cse12 (= ~IPC~0 ~s~0)) (.cse11 (<= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (and .cse6 .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse11) (and .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse8 .cse10) (and .cse6 (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse11)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (= 259 main_~status~1))) (< 0 |old(~PagingReferenceCount~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12) (and .cse6 .cse1 .cse2 .cse8 .cse4 .cse10 .cse12 .cse11) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 10:09:05,578 INFO L425 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2018-11-18 10:09:05,578 INFO L425 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2018-11-18 10:09:05,578 INFO L425 ceAbstractionStarter]: For program point $Ultimate##17(lines 748 773) no Hoare annotation was computed. [2018-11-18 10:09:05,578 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 748 773) no Hoare annotation was computed. [2018-11-18 10:09:05,578 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2018-11-18 10:09:05,578 INFO L425 ceAbstractionStarter]: For program point L715(lines 715 718) no Hoare annotation was computed. [2018-11-18 10:09:05,578 INFO L421 ceAbstractionStarter]: At program point L715-2(lines 715 718) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= 0 ~PagingReferenceCount~0)) (.cse5 (<= ~s~0 1)) (.cse6 (<= ~MPR3~0 6)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (<= 6 ~MPR3~0)) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse10 (= ~s~0 ~NP~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (= 0 main_~status~1)) (.cse13 (<= ~PagingReferenceCount~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1073741637) 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 10:09:05,578 INFO L421 ceAbstractionStarter]: At program point L740(lines 739 775) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= 0 main_~status~1) (<= ~PagingReferenceCount~0 0) (<= ~s~0 ~NP~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (<= 0 ~PagingReferenceCount~0) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,578 INFO L425 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2018-11-18 10:09:05,579 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 666 838) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (<= 0 ~PagingReferenceCount~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (<= ~PagingReferenceCount~0 0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,579 INFO L425 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2018-11-18 10:09:05,579 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2018-11-18 10:09:05,579 INFO L425 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2018-11-18 10:09:05,579 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2018-11-18 10:09:05,579 INFO L425 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2018-11-18 10:09:05,579 INFO L421 ceAbstractionStarter]: At program point L825(line 825) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,579 INFO L425 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2018-11-18 10:09:05,579 INFO L425 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2018-11-18 10:09:05,579 INFO L421 ceAbstractionStarter]: At program point L801(line 801) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,579 INFO L421 ceAbstractionStarter]: At program point L735(lines 734 776) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 main_~status~1)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,580 INFO L421 ceAbstractionStarter]: At program point L810(lines 797 830) the Hoare annotation is: (let ((.cse2 (= ~DC~0 ~s~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse9 (= main_~status~1 ~lowerDriverReturn~0)) (.cse11 (<= ~compRegistered~0 0)) (.cse0 (and .cse2 .cse5 .cse4 .cse6))) (let ((.cse12 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse8 (or (and .cse9 .cse4 .cse5 .cse6 .cse11) .cse0))) (let ((.cse1 (not (= 259 main_~status~1))) (.cse3 (= 0 main_~status~1)) (.cse7 (and .cse12 (and .cse10 .cse8)))) (or (and .cse0 .cse1) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse2 .cse3) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (and .cse4 .cse5 .cse6 (= ~pended~0 1)) (and (and (and (<= 1 ~NP~0) .cse7) (<= ~MPR3~0 6)) .cse1) (and .cse8 .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse7 (<= (+ main_~status~1 1073741536) 0)) (and .cse9 (and (and .cse10 .cse4 .cse5 .cse6 .cse11) .cse12 (<= ~SKIP2~0 ~s~0))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)))))) [2018-11-18 10:09:05,580 INFO L425 ceAbstractionStarter]: For program point L744(lines 744 774) no Hoare annotation was computed. [2018-11-18 10:09:05,580 INFO L421 ceAbstractionStarter]: At program point L794(lines 787 833) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse5 (= ~pended~0 1)) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse10 (= main_~status~1 ~lowerDriverReturn~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 main_~status~1)) (.cse6 (= ~IPC~0 ~s~0)) (.cse7 (<= ~compRegistered~0 0))) (or (and (and .cse0 .cse1 .cse2 .cse3) (not (= 259 main_~status~1))) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse4) (and .cse2 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse8 (and .cse9 (or (and .cse10 .cse2 .cse1 .cse3 .cse4 .cse7) (and .cse2 .cse1 .cse3 .cse5 .cse7)))) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse5) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (and .cse10 (and .cse9 .cse2 .cse1 .cse3 .cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse7)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse10 .cse2 .cse1 .cse3 .cse4 .cse6 .cse7) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 10:09:05,580 INFO L425 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2018-11-18 10:09:05,580 INFO L421 ceAbstractionStarter]: At program point L819(line 819) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 10:09:05,580 INFO L421 ceAbstractionStarter]: At program point L786(lines 779 834) the Hoare annotation is: (let ((.cse3 (= 0 ~compRegistered~0)) (.cse5 (= ~pended~0 1)) (.cse0 (= ~DC~0 ~s~0)) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= ~SKIP2~0 ~s~0)) (.cse9 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= 0 ~pended~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (= 0 main_~status~1)) (.cse8 (= ~IPC~0 ~s~0)) (.cse12 (<= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (and .cse6 .cse2 .cse1 .cse3 .cse4 .cse7 .cse5) (and .cse2 .cse1 .cse3 .cse4 .cse5 .cse8) (not (= |old(~compRegistered~0)| 0)) (and .cse9 .cse6 .cse1 .cse2 .cse10 .cse4 .cse7 .cse11 .cse12) (and .cse0 .cse10 .cse11) (and (and .cse0 .cse1 .cse2 .cse10 .cse4) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (and .cse9 (and .cse6 .cse1 .cse2 .cse10 .cse4 .cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse12)) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse8 .cse12) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 10:09:05,581 INFO L425 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2018-11-18 10:09:05,581 INFO L421 ceAbstractionStarter]: At program point L745(lines 744 774) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= 0 ~PagingReferenceCount~0)) (.cse5 (<= ~s~0 1)) (.cse6 (<= ~MPR3~0 6)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (<= 6 ~MPR3~0)) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse10 (= ~s~0 ~NP~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (= 0 main_~status~1)) (.cse13 (<= ~PagingReferenceCount~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1073741637) 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 10:09:05,581 INFO L421 ceAbstractionStarter]: At program point L1176(line 1176) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-18 10:09:05,581 INFO L425 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2018-11-18 10:09:05,581 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2018-11-18 10:09:05,581 INFO L421 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 1167 1180) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-18 10:09:05,581 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1167 1180) no Hoare annotation was computed. [2018-11-18 10:09:05,581 INFO L421 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (or (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~setEventCalled~0 1) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1))) [2018-11-18 10:09:05,582 INFO L425 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-18 10:09:05,582 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 951 964) the Hoare annotation is: (let ((.cse3 (= 0 ~pended~0)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (not .cse3) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse4)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~setEventCalled~0 1) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= (+ ~NP~0 2) ~SKIP1~0) .cse3 (= ~s~0 ~NP~0) (<= .cse4 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2)))) [2018-11-18 10:09:05,582 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-18 10:09:05,582 INFO L428 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2018-11-18 10:09:05,582 INFO L425 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-18 10:09:05,582 INFO L428 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2018-11-18 10:09:05,582 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 601 610) no Hoare annotation was computed. [2018-11-18 10:09:05,582 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2018-11-18 10:09:05,583 INFO L421 ceAbstractionStarter]: At program point L1088(lines 1087 1099) the Hoare annotation is: (let ((.cse33 (+ ~DC~0 5)) (.cse34 (= 0 ~pended~0))) (let ((.cse21 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (not .cse34)) (.cse14 (< ~compRegistered~0 1)) (.cse16 (< ~IPC~0 .cse33)) (.cse31 (+ ~SKIP1~0 2)) (.cse30 (<= 1 ~s~0)) (.cse32 (+ ~DC~0 2))) (let ((.cse1 (and (<= .cse33 ~IPC~0) .cse34 (<= ~PagingReferenceCount~0 1) (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse30 (<= ~s~0 ~NP~0) (<= .cse32 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse29 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (< 6 ~MPR3~0)) (.cse24 (< ~NP~0 1)) (.cse26 (or .cse21 (or .cse11 .cse14 .cse16))) (.cse6 (< ~SKIP2~0 .cse32)) (.cse7 (< ~MPR3~0 6)) (.cse8 (< 1 ~NP~0)) (.cse9 (< ~MPR1~0 .cse31)) (.cse10 (< |old(~setEventCalled~0)| 1)) (.cse27 (< ~MPR3~0 |old(~s~0)|)) (.cse12 (< 1 ~PagingReferenceCount~0)) (.cse13 (<= ~PagingReferenceCount~0 0)) (.cse28 (< |old(~s~0)| ~MPR3~0)) (.cse18 (< 1 |old(~setEventCalled~0)|))) (let ((.cse0 (< 0 (+ ~myStatus~0 1073741637))) (.cse22 (not (= ~compRegistered~0 0))) (.cse3 (< 0 ~MaximumInterfaceType~0)) (.cse20 (or .cse4 .cse24 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse12 .cse13 .cse28 .cse18)) (.cse19 (and .cse30 (<= ~s~0 1) .cse29)) (.cse25 (not (= ~myStatus~0 0))) (.cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse2 (and .cse1 .cse29)) (.cse15 (< ~NP~0 |old(~s~0)|)) (.cse17 (< |old(~s~0)| 1)) (.cse23 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (or (and (= |old(~customIrp~0)| 1) .cse1 (= 0 ~customIrp~0)) .cse2) .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse19 .cse3 .cse20) (or .cse21 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse9 (= |old(~s~0)| ~s~0) .cse22 .cse6 .cse16) (or .cse21 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse22 .cse11 .cse15 .cse16 .cse17 .cse23) (or .cse4 .cse24 .cse25 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse12 .cse13 .cse19 .cse23 .cse28 .cse18) (or .cse25 .cse3 .cse20 .cse19) (or .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18)))))) [2018-11-18 10:09:05,589 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2018-11-18 10:09:05,589 INFO L421 ceAbstractionStarter]: At program point L1080(line 1080) the Hoare annotation is: (let ((.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse11 (< ~compRegistered~0 1)) (.cse13 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse19 (< ~NP~0 1)) (.cse20 (or .cse17 (or .cse8 .cse11 .cse13))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~MPR3~0 6)) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse21 (< ~MPR3~0 |old(~s~0)|)) (.cse9 (< 1 ~PagingReferenceCount~0)) (.cse10 (<= ~PagingReferenceCount~0 0)) (.cse22 (< |old(~s~0)| ~MPR3~0)) (.cse16 (< 1 |old(~setEventCalled~0)|))) (let ((.cse18 (not (= ~compRegistered~0 0))) (.cse15 (not (= |old(~customIrp~0)| 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse12 (< ~NP~0 |old(~s~0)|)) (.cse14 (< |old(~s~0)| 1)) (.cse23 (< 0 (+ ~myStatus~0 1073741637))) (.cse1 (not (= ~myStatus~0 0))) (.cse24 (< 0 ~MaximumInterfaceType~0)) (.cse25 (or .cse0 .cse19 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse10 .cse22 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse12 .cse13 .cse14 .cse15) (or .cse17 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse18 .cse3 .cse13) (or .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse10 .cse15 .cse22 .cse16) (or .cse23 .cse24 (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16)) (or .cse23 .cse24 .cse25) (or .cse1 .cse24 .cse25))))) [2018-11-18 10:09:05,592 INFO L425 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2018-11-18 10:09:05,592 INFO L425 ceAbstractionStarter]: For program point L1078-1(lines 1065 1084) no Hoare annotation was computed. [2018-11-18 10:09:05,592 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 1091 1098) no Hoare annotation was computed. [2018-11-18 10:09:05,592 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1091 1098) no Hoare annotation was computed. [2018-11-18 10:09:05,592 INFO L425 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2018-11-18 10:09:05,592 INFO L425 ceAbstractionStarter]: For program point L1087(lines 1087 1099) no Hoare annotation was computed. [2018-11-18 10:09:05,592 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1060 1101) no Hoare annotation was computed. [2018-11-18 10:09:05,593 INFO L421 ceAbstractionStarter]: At program point L1073(lines 1065 1084) the Hoare annotation is: (let ((.cse24 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse19 (not (= 0 ~pended~0))) (.cse20 (< ~compRegistered~0 1)) (.cse22 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse1 (< ~NP~0 1)) (.cse3 (or .cse24 (or .cse19 .cse20 .cse22))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~MPR3~0 6)) (.cse6 (< 1 ~NP~0)) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< |old(~setEventCalled~0)| 1)) (.cse9 (< ~MPR3~0 |old(~s~0)|)) (.cse10 (< 1 ~PagingReferenceCount~0)) (.cse11 (<= ~PagingReferenceCount~0 0)) (.cse13 (< |old(~s~0)| ~MPR3~0)) (.cse14 (< 1 |old(~setEventCalled~0)|)) (.cse27 (= |old(~customIrp~0)| ~customIrp~0)) (.cse25 (= |old(~s~0)| ~s~0))) (let ((.cse26 (not (= ~compRegistered~0 0))) (.cse16 (< 0 (+ ~myStatus~0 1073741637))) (.cse18 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse15 (and .cse27 (<= 1 ~setEventCalled~0) .cse25 (<= ~setEventCalled~0 1))) (.cse21 (< ~NP~0 |old(~s~0)|)) (.cse23 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse2 (not (= ~myStatus~0 0))) (.cse17 (< 0 ~MaximumInterfaceType~0)) (.cse28 (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse16 .cse17 (or .cse0 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse14)) (or .cse24 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse7 .cse25 .cse26 .cse4 .cse22) (or .cse24 .cse0 (and (<= 1 ~s~0) (<= ~s~0 1) .cse27) .cse4 .cse5 .cse6 .cse7 .cse26 .cse19 .cse21 .cse22 .cse23 .cse12) (or .cse16 .cse17 .cse28) (or .cse0 .cse2 .cse18 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse19 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse12 .cse14) (or .cse2 .cse17 .cse28))))) [2018-11-18 10:09:05,595 INFO L425 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2018-11-18 10:09:05,595 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1060 1101) the Hoare annotation is: (let ((.cse18 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse20 (not (= 0 ~pended~0))) (.cse28 (< ~compRegistered~0 1)) (.cse22 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse1 (< ~NP~0 1)) (.cse3 (or .cse18 (or .cse20 .cse28 .cse22))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~MPR3~0 6)) (.cse6 (< 1 ~NP~0)) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse12 (< ~MPR3~0 |old(~s~0)|)) (.cse13 (< 1 ~PagingReferenceCount~0)) (.cse14 (<= ~PagingReferenceCount~0 0)) (.cse16 (< |old(~s~0)| ~MPR3~0)) (.cse17 (< 1 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (<= 1 ~setEventCalled~0)) (.cse30 (= |old(~s~0)| ~s~0)) (.cse9 (<= ~setEventCalled~0 1))) (let ((.cse25 (< 0 (+ ~myStatus~0 1073741637))) (.cse27 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse21 (< ~NP~0 |old(~s~0)|)) (.cse23 (< |old(~s~0)| 1)) (.cse15 (not (= |old(~customIrp~0)| 0))) (.cse2 (not (= ~myStatus~0 0))) (.cse26 (< 0 ~MaximumInterfaceType~0)) (.cse24 (and .cse7 .cse8 .cse30 .cse9)) (.cse29 (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17)) (.cse19 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or (and (<= 1 ~s~0) (<= ~s~0 1) .cse7) .cse18 .cse0 .cse4 .cse5 .cse6 .cse10 .cse19 .cse20 .cse21 .cse22 .cse23 .cse15) (or .cse24 .cse25 .cse26 (or .cse0 .cse27 .cse4 .cse5 .cse6 .cse10 .cse11 .cse20 .cse13 .cse14 .cse28 .cse21 .cse22 .cse23 .cse17)) (or .cse25 .cse26 .cse29 .cse24) (or .cse0 .cse2 .cse24 .cse27 .cse4 .cse5 .cse6 .cse10 .cse11 .cse20 .cse13 .cse14 .cse28 .cse21 .cse22 .cse23 .cse15 .cse17) (or .cse2 .cse26 .cse24 .cse29) (or .cse18 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse10 .cse19 .cse30 .cse4 .cse22))))) [2018-11-18 10:09:05,595 INFO L421 ceAbstractionStarter]: At program point L1090(lines 1089 1099) the Hoare annotation is: (let ((.cse33 (+ ~DC~0 5)) (.cse34 (= 0 ~pended~0))) (let ((.cse21 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (not .cse34)) (.cse14 (< ~compRegistered~0 1)) (.cse16 (< ~IPC~0 .cse33)) (.cse31 (+ ~SKIP1~0 2)) (.cse30 (<= 1 ~s~0)) (.cse32 (+ ~DC~0 2))) (let ((.cse1 (and (<= .cse33 ~IPC~0) .cse34 (<= ~PagingReferenceCount~0 1) (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse30 (<= ~s~0 ~NP~0) (<= .cse32 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse29 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (< 6 ~MPR3~0)) (.cse24 (< ~NP~0 1)) (.cse26 (or .cse21 (or .cse11 .cse14 .cse16))) (.cse6 (< ~SKIP2~0 .cse32)) (.cse7 (< ~MPR3~0 6)) (.cse8 (< 1 ~NP~0)) (.cse9 (< ~MPR1~0 .cse31)) (.cse10 (< |old(~setEventCalled~0)| 1)) (.cse27 (< ~MPR3~0 |old(~s~0)|)) (.cse12 (< 1 ~PagingReferenceCount~0)) (.cse13 (<= ~PagingReferenceCount~0 0)) (.cse28 (< |old(~s~0)| ~MPR3~0)) (.cse18 (< 1 |old(~setEventCalled~0)|))) (let ((.cse0 (< 0 (+ ~myStatus~0 1073741637))) (.cse22 (not (= ~compRegistered~0 0))) (.cse3 (< 0 ~MaximumInterfaceType~0)) (.cse20 (or .cse4 .cse24 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse12 .cse13 .cse28 .cse18)) (.cse19 (and .cse30 (<= ~s~0 1) .cse29)) (.cse25 (not (= ~myStatus~0 0))) (.cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse2 (and .cse1 .cse29)) (.cse15 (< ~NP~0 |old(~s~0)|)) (.cse17 (< |old(~s~0)| 1)) (.cse23 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (or (and (= |old(~customIrp~0)| 1) .cse1 (= 0 ~customIrp~0)) .cse2) .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse19 .cse3 .cse20) (or .cse21 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse9 (= |old(~s~0)| ~s~0) .cse22 .cse6 .cse16) (or .cse21 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse22 .cse11 .cse15 .cse16 .cse17 .cse23) (or .cse4 .cse24 .cse25 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse12 .cse13 .cse19 .cse23 .cse28 .cse18) (or .cse25 .cse3 .cse20 .cse19) (or .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18)))))) [2018-11-18 10:09:05,598 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1038 1051) the Hoare annotation is: (let ((.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (not (= 0 ~pended~0))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse1 .cse0 .cse2 .cse4 .cse5) (or (or (< 6 ~MPR3~0) (or .cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse5) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse4 (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1)) (= |old(~s~0)| ~s~0)))) [2018-11-18 10:09:05,598 INFO L421 ceAbstractionStarter]: At program point L1046(line 1046) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 ~pended~0))) (.cse4 (< ~IPC~0 (+ ~DC~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 .cse2) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse0 .cse1 .cse3 .cse4) (or (< 6 ~MPR3~0) (or .cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse4) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse3 (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1)))) [2018-11-18 10:09:05,598 INFO L425 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2018-11-18 10:09:05,598 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2018-11-18 10:09:05,598 INFO L425 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2018-11-18 10:09:05,602 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 433 600) no Hoare annotation was computed. [2018-11-18 10:09:05,602 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2018-11-18 10:09:05,603 INFO L421 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 433 600) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (= |old(~s~0)| ~s~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (and .cse2 (= 0 ~myStatus~0) .cse3 .cse4)))) [2018-11-18 10:09:05,603 INFO L421 ceAbstractionStarter]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse3 (= |old(~s~0)| ~s~0)) (.cse4 (<= 1 ~compRegistered~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3 .cse4)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (and (= 0 ~myStatus~0) .cse2 .cse3 .cse4)))) [2018-11-18 10:09:05,603 INFO L425 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2018-11-18 10:09:05,603 INFO L421 ceAbstractionStarter]: At program point L532(line 532) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-18 10:09:05,603 INFO L425 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2018-11-18 10:09:05,603 INFO L421 ceAbstractionStarter]: At program point L557(lines 557 559) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,603 INFO L425 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2018-11-18 10:09:05,603 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 549 565) no Hoare annotation was computed. [2018-11-18 10:09:05,603 INFO L421 ceAbstractionStarter]: At program point L549-3(lines 549 565) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= 0 FloppyStartDevice_~InterfaceType~0) (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2)))) [2018-11-18 10:09:05,607 INFO L421 ceAbstractionStarter]: At program point L566(lines 527 592) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,607 INFO L421 ceAbstractionStarter]: At program point L525(line 525) the Hoare annotation is: (let ((.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5)) (.cse4 (+ ~SKIP1~0 2)) (.cse3 (+ ~DC~0 2))) (let ((.cse2 (and (let ((.cse7 (<= ~PagingReferenceCount~0 1)) (.cse9 (<= 1 ~s~0)) (.cse10 (<= .cse3 ~SKIP2~0)) (.cse11 (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse4 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse12 (<= ~s~0 1)) (.cse13 (<= ~MPR3~0 6)) (.cse15 (< 0 ~PagingReferenceCount~0)) (.cse16 (<= 6 ~MPR3~0)) (.cse8 (= 0 ~customIrp~0)) (.cse14 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse7 .cse8 .cse9 (<= FloppyStartDevice_~__cil_tmp42~0 259) .cse10 .cse11 .cse12 .cse13 (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse14 .cse15 .cse16) (and (and .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) .cse15 .cse16) .cse8 .cse14))) (= |old(~myStatus~0)| ~myStatus~0))) (.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse3) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse4) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse2 .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1)))) [2018-11-18 10:09:05,607 INFO L421 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,614 INFO L425 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2018-11-18 10:09:05,614 INFO L425 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2018-11-18 10:09:05,615 INFO L425 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2018-11-18 10:09:05,615 INFO L425 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2018-11-18 10:09:05,615 INFO L421 ceAbstractionStarter]: At program point L542(lines 529 569) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)) (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,615 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 537) no Hoare annotation was computed. [2018-11-18 10:09:05,615 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 543 546) no Hoare annotation was computed. [2018-11-18 10:09:05,615 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2018-11-18 10:09:05,615 INFO L425 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2018-11-18 10:09:05,615 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2018-11-18 10:09:05,615 INFO L421 ceAbstractionStarter]: At program point L585(lines 585 586) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (not (= 259 FloppyStartDevice_~ntStatus~1)) (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 10:09:05,615 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2018-11-18 10:09:05,621 INFO L425 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2018-11-18 10:09:05,621 INFO L425 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2018-11-18 10:09:05,621 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-11-18 10:09:05,621 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2018-11-18 10:09:05,621 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2018-11-18 10:09:05,621 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2018-11-18 10:09:05,621 INFO L421 ceAbstractionStarter]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse5 (= |old(~s~0)| ~s~0)) (.cse10 (<= ~MPR3~0 ~s~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (<= 1 ~setEventCalled~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse11 (<= ~s~0 ~MPR3~0)) (.cse7 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse8 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse9 (<= ~setEventCalled~0 1))) (and (let ((.cse2 (= 0 ~myStatus~0))) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9))) (let ((.cse12 (= |old(~myStatus~0)| ~myStatus~0))) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse10 .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9))))) [2018-11-18 10:09:05,621 INFO L425 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2018-11-18 10:09:05,621 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 578) no Hoare annotation was computed. [2018-11-18 10:09:05,622 INFO L421 ceAbstractionStarter]: At program point L571-2(lines 571 578) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,622 INFO L421 ceAbstractionStarter]: At program point L596(line 596) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L421 ceAbstractionStarter]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L428 ceAbstractionStarter]: At program point L1134(lines 1133 1143) the Hoare annotation is: true [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L428 ceAbstractionStarter]: At program point L1132(lines 1131 1143) the Hoare annotation is: true [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point L1131(lines 1131 1143) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1135 1142) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L428 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1135 1142) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1124 1145) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2018-11-18 10:09:05,626 INFO L428 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2018-11-18 10:09:05,626 INFO L425 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1102 1123) no Hoare annotation was computed. [2018-11-18 10:09:05,627 INFO L428 ceAbstractionStarter]: At program point L1112(lines 1111 1121) the Hoare annotation is: true [2018-11-18 10:09:05,627 INFO L428 ceAbstractionStarter]: At program point L1110(lines 1109 1121) the Hoare annotation is: true [2018-11-18 10:09:05,627 INFO L425 ceAbstractionStarter]: For program point L1109(lines 1109 1121) no Hoare annotation was computed. [2018-11-18 10:09:05,631 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1113 1120) no Hoare annotation was computed. [2018-11-18 10:09:05,631 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1113 1120) no Hoare annotation was computed. [2018-11-18 10:09:05,631 INFO L425 ceAbstractionStarter]: For program point L849(lines 849 861) no Hoare annotation was computed. [2018-11-18 10:09:05,631 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2018-11-18 10:09:05,631 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 839 863) no Hoare annotation was computed. [2018-11-18 10:09:05,631 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 853 860) no Hoare annotation was computed. [2018-11-18 10:09:05,631 INFO L421 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 839 863) the Hoare annotation is: (let ((.cse3 (= 0 ~pended~0)) (.cse5 (+ ~SKIP1~0 2)) (.cse6 (+ ~DC~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= ~s~0 ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse5) (< ~compRegistered~0 1) (< ~SKIP2~0 .cse6) (< ~IPC~0 .cse4)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~s~0 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= ~PagingReferenceCount~0 1) (= 0 ~customIrp~0) (<= 1 ~s~0) (and .cse3 (<= .cse4 ~IPC~0) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse6 ~SKIP2~0) (<= ~s~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2)))) [2018-11-18 10:09:05,631 INFO L428 ceAbstractionStarter]: At program point L852(lines 851 861) the Hoare annotation is: true [2018-11-18 10:09:05,631 INFO L428 ceAbstractionStarter]: At program point L850(lines 849 861) the Hoare annotation is: true [2018-11-18 10:09:05,631 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 853 860) no Hoare annotation was computed. [2018-11-18 10:09:05,631 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2018-11-18 10:09:05,632 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1052 1059) no Hoare annotation was computed. [2018-11-18 10:09:05,632 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2018-11-18 10:09:05,632 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2018-11-18 10:09:05,632 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 653 665) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 ~PagingReferenceCount~0) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~PagingReferenceCount~0 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~s~0)| ~s~0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse2 .cse1))) [2018-11-18 10:09:05,632 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 653 665) no Hoare annotation was computed. [2018-11-18 10:09:05,632 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2018-11-18 10:09:05,637 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2018-11-18 10:09:05,637 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 1622 1629) no Hoare annotation was computed. [2018-11-18 10:09:05,637 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2018-11-18 10:09:05,638 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2018-11-18 10:09:05,638 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-11-18 10:09:05,638 INFO L421 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (< ~NP~0 ~s~0)) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse10 (< ~s~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse8 .cse9 .cse10 (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 (< 0 |old(~PagingReferenceCount~0)|) .cse3 .cse4 (< |old(~PagingReferenceCount~0)| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-11-18 10:09:05,638 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 122) no Hoare annotation was computed. [2018-11-18 10:09:05,638 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2018-11-18 10:09:05,638 INFO L421 ceAbstractionStarter]: At program point L120-2(lines 120 122) the Hoare annotation is: (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~MPR3~0 6)) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse0 (= 0 ~pended~0)) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~NP~0 ~s~0)) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~s~0 1))) (and (or (and .cse0 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse1 .cse2 .cse3 (< 0 |old(~PagingReferenceCount~0)|) .cse4 .cse5 (< |old(~PagingReferenceCount~0)| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse0 (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0))) .cse8 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse9 .cse10 .cse11 (not (= ~customIrp~0 0))))) [2018-11-18 10:09:05,638 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2018-11-18 10:09:05,638 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2018-11-18 10:09:05,638 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2018-11-18 10:09:05,638 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 133) no Hoare annotation was computed. [2018-11-18 10:09:05,639 INFO L421 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 96 158) the Hoare annotation is: (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~MPR3~0 6)) (.cse5 (< 1 ~NP~0)) (.cse0 (= 0 ~pended~0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~NP~0 ~s~0)) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~s~0 1))) (and (or (and .cse0 (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) .cse1 .cse2 .cse3 (< 0 |old(~PagingReferenceCount~0)|) .cse4 .cse5 (< |old(~PagingReferenceCount~0)| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse0 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse6 .cse7 .cse8 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse9 .cse10 .cse11 (not (= ~customIrp~0 0))))) [2018-11-18 10:09:05,643 INFO L425 ceAbstractionStarter]: For program point L131-2(lines 131 133) no Hoare annotation was computed. [2018-11-18 10:09:05,643 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2018-11-18 10:09:05,643 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2018-11-18 10:09:05,643 INFO L425 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2018-11-18 10:09:05,643 INFO L421 ceAbstractionStarter]: At program point L140(line 140) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse4 (= FlQueueIrpToThread_~status~0 0)) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (< ~MPR3~0 6)) (.cse8 (< 1 ~NP~0)) (.cse2 (= 0 ~pended~0)) (.cse9 (<= (+ FlQueueIrpToThread_~status~0 1073741823) 0)) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= ~compRegistered~0 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~NP~0 ~s~0)) (.cse14 (< ~IPC~0 (+ ~DC~0 5))) (.cse15 (< ~s~0 1))) (and (let ((.cse3 (<= ~PagingReferenceCount~0 1)) (.cse5 (< 0 ~PagingReferenceCount~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 (< 0 |old(~PagingReferenceCount~0)|) .cse7 .cse8 (and .cse2 .cse3 .cse9 .cse5) (< |old(~PagingReferenceCount~0)| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (let ((.cse16 (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)))) (or .cse0 .cse1 (and .cse2 .cse16 .cse4) .cse6 .cse7 .cse8 (and .cse2 .cse16 .cse9) .cse10 .cse11 .cse12 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse13 .cse14 .cse15 (not (= ~customIrp~0 0)))))) [2018-11-18 10:09:05,643 INFO L425 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2018-11-18 10:09:05,643 INFO L421 ceAbstractionStarter]: At program point L138(lines 138 139) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse5 (= 0 ~pended~0)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~NP~0 ~s~0)) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~s~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0))) .cse6 .cse7 .cse8 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse9 .cse10 .cse11 (not (= ~customIrp~0 0))) (or .cse0 .cse1 (and .cse5 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse2 (< 0 |old(~PagingReferenceCount~0)|) .cse3 .cse4 (< |old(~PagingReferenceCount~0)| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-11-18 10:09:05,643 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2018-11-18 10:09:05,643 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1010) no Hoare annotation was computed. [2018-11-18 10:09:05,644 INFO L421 ceAbstractionStarter]: At program point L989(lines 988 1011) the Hoare annotation is: (let ((.cse26 (+ ~DC~0 2)) (.cse23 (+ ~DC~0 5)) (.cse24 (= 0 ~pended~0)) (.cse25 (+ ~SKIP1~0 2))) (let ((.cse16 (< ~MPR1~0 .cse25)) (.cse19 (not .cse24)) (.cse21 (< ~IPC~0 .cse23)) (.cse20 (< ~SKIP2~0 .cse26)) (.cse27 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse4 (<= (+ .cse27 1) 0)) (.cse5 (<= 1 ~setEventCalled~0)) (.cse22 (+ ~NP~0 2)) (.cse6 (= ~MPR1~0 ~s~0)) (.cse7 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse27) 3221225494))) (.cse8 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse9 (<= ~setEventCalled~0 1)) (.cse10 (< 6 ~MPR3~0)) (.cse11 (or .cse16 (or .cse19 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse21) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse20 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse12 (< ~MPR3~0 6))) (let ((.cse0 (or .cse10 .cse11 .cse12)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= 1 ~NP~0) (<= .cse23 ~IPC~0) .cse24 (<= ~PagingReferenceCount~0 1) (<= ~NP~0 1) .cse4 (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) .cse5 (<= 6 ~MPR3~0) (<= .cse22 ~SKIP1~0) (<= .cse25 ~MPR1~0) (<= 1 ~compRegistered~0) .cse6 (<= .cse26 ~SKIP2~0) .cse7 .cse8 (<= ~MaximumInterfaceType~0 0) .cse9 (< 0 ~PagingReferenceCount~0))) (.cse3 (not (= ~myStatus~0 0))) (.cse15 (= ~s~0 ~SKIP1~0)) (.cse13 (< ~SKIP1~0 .cse22)) (.cse14 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= ~compRegistered~0 0))) (.cse18 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse1 .cse2) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse3 .cse12 (not (= ~customIrp~0 0))) (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse15 .cse16 (or .cse13 .cse14 (not (= 1 ~pended~0)) .cse17 .cse18 .cse20 .cse21))))))) [2018-11-18 10:09:05,648 INFO L421 ceAbstractionStarter]: At program point L981(line 981) the Hoare annotation is: (let ((.cse17 (+ ~DC~0 5)) (.cse16 (= 0 ~pended~0))) (let ((.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not .cse16)) (.cse14 (< ~IPC~0 .cse17)) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse3 (< 6 ~MPR3~0)) (.cse4 (or .cse9 (or .cse12 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse14) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse13 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse6 (< ~MPR3~0 6)) (.cse15 (+ ~NP~0 2))) (let ((.cse7 (< ~SKIP1~0 .cse15)) (.cse8 (< ~MPR3~0 (+ ~NP~0 5))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse2 (let ((.cse18 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (and (<= .cse15 ~SKIP1~0) .cse16 (= ~s~0 ~NP~0) (<= .cse17 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse18 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse0 (or .cse3 .cse4 .cse6)) (.cse5 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse2 .cse6 (not (= ~customIrp~0 0))) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse9 (or .cse7 .cse8 (not (= 1 ~pended~0)) .cse10 .cse11 .cse13 .cse14)) (or .cse2 .cse0 .cse5 .cse1)))))) [2018-11-18 10:09:05,648 INFO L425 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2018-11-18 10:09:05,648 INFO L425 ceAbstractionStarter]: For program point L973-1(lines 973 985) no Hoare annotation was computed. [2018-11-18 10:09:05,648 INFO L421 ceAbstractionStarter]: At program point L994(lines 993 1010) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse12 (< 6 ~MPR3~0)) (.cse13 (or .cse3 (or .cse15 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse10) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse9 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse14 (< ~MPR3~0 6))) (let ((.cse0 (or .cse12 .cse13 .cse14)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (let ((.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ .cse16 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ~setEventCalled~0 1)))) (.cse11 (not (= ~myStatus~0 0))) (.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (= ~s~0 ~SKIP1~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse3 .cse4 (or .cse5 .cse6 (not (= 1 ~pended~0)) .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse11 .cse1 .cse2) (or .cse2 .cse12 .cse13 .cse11 .cse14 (not (= ~customIrp~0 0))) (or .cse5 .cse6 .cse4 .cse3 .cse7 .cse8 .cse15 .cse9 .cse10))))) [2018-11-18 10:09:05,652 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 965 1037) the Hoare annotation is: (let ((.cse0 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 ~pended~0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse8 (< 6 ~MPR3~0)) (.cse9 (or .cse0 (or .cse15 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse6 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse12 (< ~MPR3~0 6))) (let ((.cse10 (not (= ~myStatus~0 0))) (.cse13 (or .cse8 .cse9 .cse12)) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse11 (= ~s~0 |old(~s~0)|)) (.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 (or .cse2 .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7)) (or .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0))) (or .cse13 .cse10 .cse14 .cse11) (or (< 0 (+ ~myStatus~0 1073741637)) .cse13 .cse14 .cse11) (or .cse2 .cse3 .cse1 .cse0 .cse4 .cse5 .cse15 .cse6 .cse7))))) [2018-11-18 10:09:05,652 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 965 1037) no Hoare annotation was computed. [2018-11-18 10:09:05,652 INFO L425 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2018-11-18 10:09:05,652 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2018-11-18 10:09:05,652 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2018-11-18 10:09:05,652 INFO L421 ceAbstractionStarter]: At program point L1008(lines 972 1036) the Hoare annotation is: (let ((.cse38 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse35 (+ ~DC~0 2)) (.cse37 (+ ~DC~0 5)) (.cse28 (= 0 ~pended~0)) (.cse36 (+ ~SKIP1~0 2))) (let ((.cse0 (< ~MPR1~0 .cse36)) (.cse8 (not .cse28)) (.cse7 (< ~IPC~0 .cse37)) (.cse6 (< ~SKIP2~0 .cse35)) (.cse12 (= ~MPR1~0 ~s~0)) (.cse13 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse38) 3221225494))) (.cse14 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse9 (<= (+ .cse38 1) 0)) (.cse25 (+ ~NP~0 2))) (let ((.cse10 (= IofCallDriver_~returnVal2~0 259)) (.cse18 (let ((.cse26 (<= .cse25 ~SKIP1~0)) (.cse27 (<= .cse37 ~IPC~0)) (.cse29 (<= ~PagingReferenceCount~0 1)) (.cse30 (<= .cse36 ~MPR1~0)) (.cse31 (<= 1 ~compRegistered~0)) (.cse32 (<= .cse35 ~SKIP2~0)) (.cse33 (= ~NP~0 |old(~s~0)|)) (.cse34 (< 0 ~PagingReferenceCount~0))) (or (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse12 .cse32 .cse13 (= 0 IofCallDriver_~returnVal2~0) .cse14 .cse9 .cse33 .cse34) (and .cse26 .cse27 .cse28 .cse29 .cse30 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse31 .cse12 .cse32 .cse13 .cse14 .cse9 .cse33 .cse34)))) (.cse11 (<= 1 ~setEventCalled~0)) (.cse15 (<= ~setEventCalled~0 1)) (.cse16 (< 6 ~MPR3~0)) (.cse17 (or .cse0 (or .cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse6 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse20 (< ~MPR3~0 6))) (let ((.cse2 (< ~SKIP1~0 .cse25)) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse21 (or .cse16 .cse17 .cse20)) (.cse19 (not (= ~myStatus~0 0))) (.cse23 (< 0 ~MaximumInterfaceType~0)) (.cse24 (and (and (<= 1 ~NP~0) .cse18 (<= ~NP~0 1) (<= ~MPR3~0 6) .cse11 .cse15 (<= 6 ~MPR3~0)) (<= ~MaximumInterfaceType~0 0))) (.cse22 (and .cse9 .cse11 .cse10 .cse12 .cse13 .cse14 .cse15))) (and (or .cse0 .cse1 (or .cse2 .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7)) (or .cse2 .cse3 .cse1 .cse0 .cse4 .cse5 .cse8 .cse6 .cse7) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 (and .cse18 .cse11 .cse15) .cse19 .cse20 (not (= ~customIrp~0 0))) (or (< 0 (+ ~myStatus~0 1073741637)) .cse21 .cse22 .cse23 .cse24) (or .cse21 .cse19 .cse23 .cse24 .cse22)))))) [2018-11-18 10:09:05,656 INFO L421 ceAbstractionStarter]: At program point L975(line 975) the Hoare annotation is: (let ((.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse8 (< 6 ~MPR3~0)) (.cse9 (or .cse2 (or .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse6 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse12 (< ~MPR3~0 6))) (let ((.cse10 (not (= ~myStatus~0 0))) (.cse13 (or .cse8 .cse9 .cse12)) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse11 (= ~s~0 |old(~s~0)|)) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0))) (or .cse13 .cse10 .cse14 .cse11) (or (< 0 (+ ~myStatus~0 1073741637)) .cse13 .cse14 .cse11) (or .cse2 (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse3 .cse4 .cse6 .cse7)))))) [2018-11-18 10:09:05,656 INFO L425 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2018-11-18 10:09:05,657 INFO L421 ceAbstractionStarter]: At program point L996(lines 995 1010) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse12 (< 6 ~MPR3~0)) (.cse13 (or .cse3 (or .cse15 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse10) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse9 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse14 (< ~MPR3~0 6))) (let ((.cse0 (or .cse12 .cse13 .cse14)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (let ((.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ .cse16 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ~setEventCalled~0 1)))) (.cse11 (not (= ~myStatus~0 0))) (.cse5 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (= ~s~0 ~SKIP1~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse3 .cse4 (or .cse5 .cse6 (not (= 1 ~pended~0)) .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse11 .cse1 .cse2) (or .cse2 .cse12 .cse13 .cse11 .cse14 (not (= ~customIrp~0 0))) (or .cse5 .cse6 .cse4 .cse3 .cse7 .cse8 .cse15 .cse9 .cse10))))) [2018-11-18 10:09:05,660 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 997 1009) no Hoare annotation was computed. [2018-11-18 10:09:05,660 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 997 1009) no Hoare annotation was computed. [2018-11-18 10:09:05,660 INFO L425 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2018-11-18 10:09:05,660 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1011) no Hoare annotation was computed. [2018-11-18 10:09:05,660 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1023) no Hoare annotation was computed. [2018-11-18 10:09:05,661 INFO L421 ceAbstractionStarter]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or .cse4 (or .cse7 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse9) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse8 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (or .cse10 .cse11 .cse13)) (.cse12 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0))) (or .cse0 .cse12 .cse1) (or .cse4 (or .cse2 .cse3 (not (= 1 ~pended~0)) .cse5 .cse6 .cse8 .cse9)))))) [2018-11-18 10:09:05,661 INFO L425 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2018-11-18 10:09:05,661 INFO L421 ceAbstractionStarter]: At program point L1307(line 1307) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,661 INFO L425 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2018-11-18 10:09:05,661 INFO L425 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2018-11-18 10:09:05,661 INFO L425 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2018-11-18 10:09:05,662 INFO L425 ceAbstractionStarter]: For program point $Ultimate##38(lines 1400 1526) no Hoare annotation was computed. [2018-11-18 10:09:05,662 INFO L425 ceAbstractionStarter]: For program point $Ultimate##37(lines 1400 1526) no Hoare annotation was computed. [2018-11-18 10:09:05,662 INFO L421 ceAbstractionStarter]: At program point L1514(line 1514) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,662 INFO L425 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2018-11-18 10:09:05,662 INFO L425 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2018-11-18 10:09:05,662 INFO L421 ceAbstractionStarter]: At program point L1316(lines 1315 1549) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,662 INFO L421 ceAbstractionStarter]: At program point L1399(lines 1389 1529) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,662 INFO L425 ceAbstractionStarter]: For program point L1424(lines 1424 1427) no Hoare annotation was computed. [2018-11-18 10:09:05,662 INFO L421 ceAbstractionStarter]: At program point L1292(line 1292) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,662 INFO L425 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2018-11-18 10:09:05,663 INFO L421 ceAbstractionStarter]: At program point L1449(line 1449) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (<= ~s~0 1)) (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,663 INFO L425 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2018-11-18 10:09:05,663 INFO L421 ceAbstractionStarter]: At program point L1383(lines 1375 1533) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,666 INFO L425 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2018-11-18 10:09:05,666 INFO L425 ceAbstractionStarter]: For program point L1433(lines 1433 1437) no Hoare annotation was computed. [2018-11-18 10:09:05,666 INFO L421 ceAbstractionStarter]: At program point L1301(line 1301) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,666 INFO L421 ceAbstractionStarter]: At program point L1557(line 1557) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse2 (+ ~DC~0 2))) (let ((.cse0 (and (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~pended~0) .cse1 (<= .cse2 ~SKIP2~0)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= FloppyDeviceControl_~__cil_tmp91~0 FloppyDeviceControl_~ntStatus~3) .cse0) (and .cse1 (= ~pended~0 1)) (< ~SKIP2~0 .cse2) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (<= (+ FloppyDeviceControl_~ntStatus~3 1073741811) 0) .cse0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)))) [2018-11-18 10:09:05,666 INFO L425 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2018-11-18 10:09:05,666 INFO L425 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2018-11-18 10:09:05,666 INFO L421 ceAbstractionStarter]: At program point L1483(lines 1347 1541) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (<= ~s~0 1)) (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,666 INFO L425 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2018-11-18 10:09:05,666 INFO L425 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2018-11-18 10:09:05,666 INFO L425 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2018-11-18 10:09:05,667 INFO L421 ceAbstractionStarter]: At program point L1525(lines 1400 1526) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= 0 ~pended~0) .cse0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (< 6 ~MPR3~0) (< ~NP~0 1) (and .cse0 (= ~pended~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)))) [2018-11-18 10:09:05,667 INFO L425 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2018-11-18 10:09:05,667 INFO L425 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2018-11-18 10:09:05,668 INFO L425 ceAbstractionStarter]: For program point L1410(lines 1410 1414) no Hoare annotation was computed. [2018-11-18 10:09:05,668 INFO L421 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 1182 1563) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (<= ~s~0 1)) (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,668 INFO L425 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2018-11-18 10:09:05,668 INFO L425 ceAbstractionStarter]: For program point L1320(lines 1320 1547) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1502(lines 1502 1504) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1494(lines 1494 1497) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L421 ceAbstractionStarter]: At program point L1321(lines 1320 1547) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1396(lines 1396 1527) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L421 ceAbstractionStarter]: At program point L1520(lines 1520 1521) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2018-11-18 10:09:05,669 INFO L425 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L421 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)))) [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L421 ceAbstractionStarter]: At program point L1339(lines 1329 1545) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (<= ~s~0 1)) (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point L1389(lines 1389 1529) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point L1315(lines 1315 1549) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 1564 1580) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L428 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-18 10:09:05,672 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:09:05,672 INFO L421 ceAbstractionStarter]: At program point L1598(line 1598) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (and (<= |old(~PagingReferenceCount~0)| 1) (< 0 |old(~PagingReferenceCount~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 10:09:05,673 INFO L425 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2018-11-18 10:09:05,673 INFO L425 ceAbstractionStarter]: For program point L1590(lines 1590 1592) no Hoare annotation was computed. [2018-11-18 10:09:05,673 INFO L425 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2018-11-18 10:09:05,679 INFO L421 ceAbstractionStarter]: At program point L1613(line 1613) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (<= |old(~PagingReferenceCount~0)| 1) (< 0 |old(~PagingReferenceCount~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L421 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 1581 1620) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (<= |old(~PagingReferenceCount~0)| 1) (< 0 |old(~PagingReferenceCount~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)))) [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point L1601(lines 1601 1603) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point L1601-2(lines 1601 1603) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 1581 1620) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L421 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse6 (< 0 ~MaximumInterfaceType~0)) (.cse1 (<= ~MPR3~0 ~s~0)) (.cse2 (<= ~s~0 ~MPR3~0)) (.cse3 (<= 1 ~setEventCalled~0)) (.cse5 (<= ~setEventCalled~0 1)) (.cse4 (= 259 FlFdcDeviceIo_~__cil_tmp11~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) (not (= ~myStatus~0 0)) .cse6) (or .cse0 (and (<= 1 ~s~0) (<= ~s~0 ~NP~0) .cse3 .cse4 .cse5) (< 0 (+ ~myStatus~0 1073741637)) .cse6 (and (and .cse1 .cse2 .cse3 .cse5) .cse4)))) [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L425 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2018-11-18 10:09:05,680 INFO L421 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 611 645) the Hoare annotation is: (let ((.cse3 (= 0 ~pended~0)) (.cse5 (+ ~SKIP1~0 2)) (.cse6 (+ ~DC~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse5) (< ~compRegistered~0 1) (< ~SKIP2~0 .cse6) (< ~IPC~0 .cse4)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= ~PagingReferenceCount~0 1) (= 0 ~customIrp~0) (<= 1 ~s~0) (and .cse3 (<= .cse4 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse6 ~SKIP2~0) (<= ~s~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2)))) [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2018-11-18 10:09:05,683 INFO L421 ceAbstractionStarter]: At program point L632(line 632) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2))) [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2018-11-18 10:09:05,683 INFO L421 ceAbstractionStarter]: At program point L623(lines 623 624) the Hoare annotation is: (let ((.cse3 (= 0 ~pended~0)) (.cse5 (+ ~SKIP1~0 2)) (.cse6 (+ ~DC~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse5) (< ~compRegistered~0 1) (< ~SKIP2~0 .cse6) (< ~IPC~0 .cse4)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= ~PagingReferenceCount~0 1) (= 0 ~customIrp~0) (<= 1 ~s~0) (and .cse3 (<= .cse4 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse6 ~SKIP2~0) (<= ~s~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2)))) [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 89 95) no Hoare annotation was computed. [2018-11-18 10:09:05,683 INFO L428 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2018-11-18 10:09:05,683 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (<= ~PagingReferenceCount~0 0) (= ~IPC~0 ~s~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (<= 0 ~PagingReferenceCount~0) (<= ~MaximumInterfaceType~0 0)) [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point L873(lines 872 882) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 864 884) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point L871(lines 870 882) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point L870(lines 870 882) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 874 881) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 874 881) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point L896(lines 895 905) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point L894(lines 893 905) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 905) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 897 904) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 885 907) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 897 904) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point L1153(lines 1152 1164) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point L1152(lines 1152 1164) no Hoare annotation was computed. [2018-11-18 10:09:05,690 INFO L428 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2018-11-18 10:09:05,690 INFO L425 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1146 1166) no Hoare annotation was computed. [2018-11-18 10:09:05,691 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1156 1163) no Hoare annotation was computed. [2018-11-18 10:09:05,691 INFO L428 ceAbstractionStarter]: At program point L1155(lines 1154 1164) the Hoare annotation is: true [2018-11-18 10:09:05,691 INFO L425 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2018-11-18 10:09:05,696 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1156 1163) no Hoare annotation was computed. [2018-11-18 10:09:05,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:09:05 BoogieIcfgContainer [2018-11-18 10:09:05,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:09:05,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:09:05,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:09:05,760 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:09:05,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:08:27" (3/4) ... [2018-11-18 10:09:05,764 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:09:05,770 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-18 10:09:05,770 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-18 10:09:05,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-18 10:09:05,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-18 10:09:05,773 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-18 10:09:05,773 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-18 10:09:05,773 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-18 10:09:05,793 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2018-11-18 10:09:05,798 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2018-11-18 10:09:05,800 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 10:09:05,801 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 10:09:05,832 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (status == lowerDriverReturn && ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || 0 < \old(PagingReferenceCount)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,833 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((((NP + 5 <= MPR3 && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (status == lowerDriverReturn && ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,833 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || (((((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1) && IPC == s) && compRegistered <= 0)) || (SKIP2 == s && NP + 2 <= SKIP1 && ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0) || ((((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0)))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (status == lowerDriverReturn && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,833 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || (((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1)) || (((1 <= NP && SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1 && (((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2))) && MPR3 <= 6) && !(259 == status))) || ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) && 0 == status)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1 && (((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2))) && status + 1073741536 <= 0)) || (status == lowerDriverReturn && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((DC == s && 0 == compRegistered) && pended == 1) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && 0 < PagingReferenceCount)) || 0 < MaximumInterfaceType) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((1 <= NP && ((((NP + 2 <= SKIP1 && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && MPR3 <= 6) && !(259 == ntStatus))) || (((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && (1 < PagingReferenceCount || PagingReferenceCount <= 0)) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && (1 < PagingReferenceCount || PagingReferenceCount <= 0))) && ((((((((((((DC == s && 0 == compRegistered) && pended == 1) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || 0 < MaximumInterfaceType) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((1 <= NP && ((((NP + 2 <= SKIP1 && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && MPR3 <= 6) && !(259 == ntStatus))) || (((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && (1 < PagingReferenceCount || PagingReferenceCount <= 0)) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && (1 < PagingReferenceCount || PagingReferenceCount <= 0))) [2018-11-18 10:09:05,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 < myStatus + 1073741637 || ((\old(customIrp) == 1 && ((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) [2018-11-18 10:09:05,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 < myStatus + 1073741637 || ((\old(customIrp) == 1 && ((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) [2018-11-18 10:09:05,837 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || (((((((((((((((((((1 <= NP && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && NP <= 1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && 6 <= MPR3) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((((((1 <= NP && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && NP <= 1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && 6 <= MPR3) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount))) && ((((((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((s == SKIP1 || MPR1 < SKIP1 + 2) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-18 10:09:05,837 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 6 < MPR3) || NP < 1) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || !(\old(s) == NP)) || !(0 == \old(pended))) || IPC < DC + 5 [2018-11-18 10:09:05,837 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((__cil_tmp7 / 4294967296 + 1 <= 0 && returnVal2 == 259) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (((((((1 <= NP && ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount))) && NP <= 1) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && MaximumInterfaceType <= 0))) && ((((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((1 <= NP && ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount))) && NP <= 1) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && MaximumInterfaceType <= 0)) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) [2018-11-18 10:09:05,837 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,838 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled)) && ((((((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) [2018-11-18 10:09:05,838 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && ((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && ((((((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-18 10:09:05,838 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && ((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && ((((((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-18 10:09:05,838 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && PagingReferenceCount <= 0) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 0 <= PagingReferenceCount) && MPR3 <= 6) && 6 <= MPR3)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,839 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) [2018-11-18 10:09:05,839 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (0 <= InterfaceType && ((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (0 <= InterfaceType && ((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-18 10:09:05,839 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && 0 <= PagingReferenceCount) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\old(myStatus) == 0)) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 <= PagingReferenceCount) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,844 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 10:09:05,844 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) [2018-11-18 10:09:05,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-18 10:09:05,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) [2018-11-18 10:09:05,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-18 10:09:05,866 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-18 10:09:05,891 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= s) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 0 < PagingReferenceCount)) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= s) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-18 10:09:05,891 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-18 10:09:05,892 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-18 10:09:05,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-18 10:09:05,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == pended && 1 <= s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount) && s <= 1) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-18 10:09:05,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == pended && 1 <= s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount) && s <= 1) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-18 10:09:05,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-18 10:09:05,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || (((0 == pended && \old(s) == s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-18 10:09:05,998 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a6669d54-b5bf-4f1e-b270-f721b12cbb41/bin-2019/uautomizer/witness.graphml [2018-11-18 10:09:05,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:09:05,998 INFO L168 Benchmark]: Toolchain (without parser) took 40066.28 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 957.5 MB in the beginning and 1.3 GB in the end (delta: -315.3 MB). Peak memory consumption was 811.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:09:05,999 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:09:05,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -216.4 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:09:05,999 INFO L168 Benchmark]: Boogie Preprocessor took 66.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:09:05,999 INFO L168 Benchmark]: RCFGBuilder took 827.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 116.7 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:09:06,000 INFO L168 Benchmark]: TraceAbstraction took 38519.80 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 944.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -276.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 10:09:06,000 INFO L168 Benchmark]: Witness Printer took 237.83 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:09:06,001 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -216.4 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 827.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 116.7 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38519.80 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 944.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -276.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 237.83 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && 0 <= PagingReferenceCount) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\old(myStatus) == 0)) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 <= PagingReferenceCount) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1320]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (0 <= InterfaceType && ((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (0 <= InterfaceType && ((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 729]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 938]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 797]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || (((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1)) || (((1 <= NP && SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1 && (((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2))) && MPR3 <= 6) && !(259 == status))) || ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) && 0 == status)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1 && (((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2))) && status + 1073741536 <= 0)) || (status == lowerDriverReturn && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: ((((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && ((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && ((((((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: ((((((((0 < myStatus + 1073741637 || ((\old(customIrp) == 1 && ((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) - InvariantResult [Line: 1347]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == pended && 1 <= s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount) && s <= 1) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1389]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || (((0 == pended && \old(s) == s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && PagingReferenceCount <= 0) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 0 <= PagingReferenceCount) && MPR3 <= 6) && 6 <= MPR3)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled)) && ((((((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= s) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 0 < PagingReferenceCount)) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= s) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: ((((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || (((((((((((((((((((1 <= NP && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && NP <= 1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && 6 <= MPR3) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((((((1 <= NP && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && NP <= 1) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && 6 <= MPR3) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount))) && ((((((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((s == SKIP1 || MPR1 < SKIP1 + 2) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 221]: Loop Invariant Derived loop invariant: (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((__cil_tmp7 / 4294967296 + 1 <= 0 && returnVal2 == 259) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (((((((1 <= NP && ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount))) && NP <= 1) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && MaximumInterfaceType <= 0))) && ((((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((1 <= NP && ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount))) && NP <= 1) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && MaximumInterfaceType <= 0)) || ((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) - InvariantResult [Line: 1152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 787]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || (((((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1) && IPC == s) && compRegistered <= 0)) || (SKIP2 == s && NP + 2 <= SKIP1 && ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0) || ((((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0)))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (status == lowerDriverReturn && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 915]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (status == lowerDriverReturn && ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || 0 < \old(PagingReferenceCount)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 936]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 734]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((((NP + 5 <= MPR3 && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (status == lowerDriverReturn && ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1400]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 6 < MPR3) || NP < 1) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || !(\old(s) == NP)) || !(0 == \old(pended))) || IPC < DC + 5 - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: ((((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && ((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && ((((((((((__cil_tmp7 / 4294967296 + 1 <= 0 && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 849]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: ((((((((0 < myStatus + 1073741637 || ((\old(customIrp) == 1 && ((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1329]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == pended && 1 <= s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount) && s <= 1) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((((DC == s && 0 == compRegistered) && pended == 1) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && 0 < PagingReferenceCount)) || 0 < MaximumInterfaceType) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((1 <= NP && ((((NP + 2 <= SKIP1 && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && MPR3 <= 6) && !(259 == ntStatus))) || (((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && (1 < PagingReferenceCount || PagingReferenceCount <= 0)) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && (1 < PagingReferenceCount || PagingReferenceCount <= 0))) && ((((((((((((DC == s && 0 == compRegistered) && pended == 1) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || 0 < MaximumInterfaceType) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((1 <= NP && ((((NP + 2 <= SKIP1 && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && MPR3 <= 6) && !(259 == ntStatus))) || (((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && (1 < PagingReferenceCount || PagingReferenceCount <= 0)) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && (1 < PagingReferenceCount || PagingReferenceCount <= 0))) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1375]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 419 locations, 1 error locations. SAFE Result, 38.4s OverallTime, 66 OverallIterations, 2 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 21.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 26883 SDtfs, 12654 SDslu, 81534 SDs, 0 SdLazy, 11137 SolverSat, 2088 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1082 GetRequests, 629 SyntacticMatches, 17 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1109occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 66 MinimizatonAttempts, 2268 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 142 LocationsWithAnnotation, 2469 PreInvPairs, 2839 NumberOfFragments, 24226 HoareAnnotationTreeSize, 2469 FomulaSimplifications, 528801 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 142 FomulaSimplificationsInter, 495446 FormulaSimplificationTreeSizeReductionInter, 19.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 5246 NumberOfCodeBlocks, 5246 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 5177 ConstructedInterpolants, 0 QuantifiedInterpolants, 842407 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3756 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 69 InterpolantComputations, 66 PerfectInterpolantSequences, 349/358 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...