./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/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 9b1a240fd075ce2cb4ef354f75e9bf02a7f7ab6f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:36:47,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:36:47,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:36:47,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:36:47,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:36:47,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:36:47,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:36:47,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:36:47,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:36:47,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:36:47,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:36:47,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:36:47,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:36:47,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:36:47,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:36:47,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:36:47,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:36:47,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:36:47,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:36:47,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:36:47,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:36:47,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:36:47,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:36:47,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:36:47,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:36:47,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:36:47,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:36:47,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:36:47,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:36:47,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:36:47,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:36:47,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:36:47,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:36:47,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:36:47,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:36:47,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:36:47,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:36:47,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:36:47,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:36:47,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:36:47,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:36:47,437 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:36:47,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:36:47,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:36:47,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:36:47,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:36:47,450 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:36:47,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:36:47,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:36:47,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:36:47,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:36:47,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:36:47,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:36:47,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:36:47,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:36:47,451 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:36:47,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:36:47,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:36:47,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:36:47,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:36:47,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:36:47,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:36:47,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:36:47,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:36:47,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:36:47,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:36:47,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:36:47,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:36:47,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:36:47,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:36:47,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/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 -> 9b1a240fd075ce2cb4ef354f75e9bf02a7f7ab6f [2019-11-19 23:36:47,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:36:47,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:36:47,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:36:47,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:36:47,608 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:36:47,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-11-19 23:36:47,660 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/data/774b2e0d4/ad8c6e4b380443c580428801b8288770/FLAGd0634e915 [2019-11-19 23:36:48,093 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:36:48,094 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-11-19 23:36:48,110 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/data/774b2e0d4/ad8c6e4b380443c580428801b8288770/FLAGd0634e915 [2019-11-19 23:36:48,456 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/data/774b2e0d4/ad8c6e4b380443c580428801b8288770 [2019-11-19 23:36:48,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:36:48,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:36:48,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:36:48,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:36:48,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:36:48,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:36:48" (1/1) ... [2019-11-19 23:36:48,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc3636c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:48, skipping insertion in model container [2019-11-19 23:36:48,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:36:48" (1/1) ... [2019-11-19 23:36:48,472 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:36:48,531 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:36:48,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:36:48,896 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:36:48,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:36:49,013 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:36:49,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49 WrapperNode [2019-11-19 23:36:49,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:36:49,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:36:49,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:36:49,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:36:49,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:36:49,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:36:49,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:36:49,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:36:49,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... [2019-11-19 23:36:49,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:36:49,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:36:49,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:36:49,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:36:49,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/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 [2019-11-19 23:36:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:36:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:36:49,637 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,644 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,651 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,654 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,656 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,658 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,661 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,665 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,667 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,667 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,671 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,674 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,684 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,685 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,687 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,689 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,693 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,696 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,699 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,701 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,704 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,706 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,707 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:49,709 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:36:50,772 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2019-11-19 23:36:50,772 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2019-11-19 23:36:50,772 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2019-11-19 23:36:50,773 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2019-11-19 23:36:50,773 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2019-11-19 23:36:50,773 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2019-11-19 23:36:50,773 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2019-11-19 23:36:50,774 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2019-11-19 23:36:50,774 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2019-11-19 23:36:50,774 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2019-11-19 23:36:50,774 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2019-11-19 23:36:50,774 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-19 23:36:50,775 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-19 23:36:50,775 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2019-11-19 23:36:50,775 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2019-11-19 23:36:50,775 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2019-11-19 23:36:50,775 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2019-11-19 23:36:50,775 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2019-11-19 23:36:50,776 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2019-11-19 23:36:50,776 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2019-11-19 23:36:50,776 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2019-11-19 23:36:50,776 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2019-11-19 23:36:50,777 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-19 23:36:50,777 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-19 23:36:50,777 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2019-11-19 23:36:50,779 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2019-11-19 23:36:50,779 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2019-11-19 23:36:50,780 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2019-11-19 23:36:50,781 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2019-11-19 23:36:50,781 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2019-11-19 23:36:50,781 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2019-11-19 23:36:50,781 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2019-11-19 23:36:50,781 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2019-11-19 23:36:50,782 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-11-19 23:36:50,782 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-11-19 23:36:50,782 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2019-11-19 23:36:50,782 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2019-11-19 23:36:50,783 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-11-19 23:36:50,783 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2019-11-19 23:36:50,783 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-11-19 23:36:50,784 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2019-11-19 23:36:50,784 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2019-11-19 23:36:50,785 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2019-11-19 23:36:50,785 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2019-11-19 23:36:50,785 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2019-11-19 23:36:50,785 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2019-11-19 23:36:50,785 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2019-11-19 23:36:50,785 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2019-11-19 23:36:50,787 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:36:50,787 INFO L285 CfgBuilder]: Removed 205 assume(true) statements. [2019-11-19 23:36:50,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:36:50 BoogieIcfgContainer [2019-11-19 23:36:50,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:36:50,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:36:50,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:36:50,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:36:50,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:36:48" (1/3) ... [2019-11-19 23:36:50,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380aae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:36:50, skipping insertion in model container [2019-11-19 23:36:50,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:36:49" (2/3) ... [2019-11-19 23:36:50,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380aae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:36:50, skipping insertion in model container [2019-11-19 23:36:50,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:36:50" (3/3) ... [2019-11-19 23:36:50,796 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-11-19 23:36:50,804 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:36:50,812 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 40 error locations. [2019-11-19 23:36:50,821 INFO L249 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2019-11-19 23:36:50,851 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:36:50,851 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:36:50,851 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:36:50,851 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:36:50,851 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:36:50,851 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:36:50,851 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:36:50,852 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:36:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states. [2019-11-19 23:36:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 23:36:50,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:50,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:50,889 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash 660910296, now seen corresponding path program 1 times [2019-11-19 23:36:50,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:50,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53773052] [2019-11-19 23:36:50,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:51,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53773052] [2019-11-19 23:36:51,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:51,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:51,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789225828] [2019-11-19 23:36:51,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:51,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:51,064 INFO L87 Difference]: Start difference. First operand 419 states. Second operand 3 states. [2019-11-19 23:36:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:51,172 INFO L93 Difference]: Finished difference Result 760 states and 1087 transitions. [2019-11-19 23:36:51,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:51,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 23:36:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:51,198 INFO L225 Difference]: With dead ends: 760 [2019-11-19 23:36:51,198 INFO L226 Difference]: Without dead ends: 413 [2019-11-19 23:36:51,213 INFO L630 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 [2019-11-19 23:36:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-19 23:36:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-11-19 23:36:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-19 23:36:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 543 transitions. [2019-11-19 23:36:51,303 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 543 transitions. Word has length 11 [2019-11-19 23:36:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:51,303 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 543 transitions. [2019-11-19 23:36:51,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 543 transitions. [2019-11-19 23:36:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 23:36:51,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:51,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:51,305 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash -32433196, now seen corresponding path program 1 times [2019-11-19 23:36:51,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:51,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800040315] [2019-11-19 23:36:51,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:51,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800040315] [2019-11-19 23:36:51,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:51,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:51,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009066438] [2019-11-19 23:36:51,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:51,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:51,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:51,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:51,404 INFO L87 Difference]: Start difference. First operand 413 states and 543 transitions. Second operand 3 states. [2019-11-19 23:36:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:51,701 INFO L93 Difference]: Finished difference Result 705 states and 932 transitions. [2019-11-19 23:36:51,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:51,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 23:36:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:51,706 INFO L225 Difference]: With dead ends: 705 [2019-11-19 23:36:51,706 INFO L226 Difference]: Without dead ends: 541 [2019-11-19 23:36:51,707 INFO L630 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 [2019-11-19 23:36:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-11-19 23:36:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 518. [2019-11-19 23:36:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-19 23:36:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 694 transitions. [2019-11-19 23:36:51,741 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 694 transitions. Word has length 13 [2019-11-19 23:36:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:51,742 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 694 transitions. [2019-11-19 23:36:51,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 694 transitions. [2019-11-19 23:36:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 23:36:51,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:51,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:51,744 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash 563627937, now seen corresponding path program 1 times [2019-11-19 23:36:51,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:51,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333435416] [2019-11-19 23:36:51,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:51,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333435416] [2019-11-19 23:36:51,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:51,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:51,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128511865] [2019-11-19 23:36:51,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:51,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:51,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:51,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:51,876 INFO L87 Difference]: Start difference. First operand 518 states and 694 transitions. Second operand 3 states. [2019-11-19 23:36:51,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:51,943 INFO L93 Difference]: Finished difference Result 991 states and 1326 transitions. [2019-11-19 23:36:51,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:51,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-19 23:36:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:51,949 INFO L225 Difference]: With dead ends: 991 [2019-11-19 23:36:51,949 INFO L226 Difference]: Without dead ends: 684 [2019-11-19 23:36:51,950 INFO L630 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 [2019-11-19 23:36:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-11-19 23:36:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 516. [2019-11-19 23:36:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-19 23:36:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 693 transitions. [2019-11-19 23:36:51,981 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 693 transitions. Word has length 16 [2019-11-19 23:36:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:51,981 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 693 transitions. [2019-11-19 23:36:51,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2019-11-19 23:36:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 23:36:51,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:51,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:36:51,984 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash 6806604, now seen corresponding path program 1 times [2019-11-19 23:36:51,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:51,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051711625] [2019-11-19 23:36:51,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:52,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051711625] [2019-11-19 23:36:52,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:52,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:52,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365210666] [2019-11-19 23:36:52,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:52,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:52,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:52,080 INFO L87 Difference]: Start difference. First operand 516 states and 693 transitions. Second operand 3 states. [2019-11-19 23:36:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:52,129 INFO L93 Difference]: Finished difference Result 595 states and 790 transitions. [2019-11-19 23:36:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:52,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 23:36:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:52,133 INFO L225 Difference]: With dead ends: 595 [2019-11-19 23:36:52,133 INFO L226 Difference]: Without dead ends: 575 [2019-11-19 23:36:52,135 INFO L630 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 [2019-11-19 23:36:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-19 23:36:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 528. [2019-11-19 23:36:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-19 23:36:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 715 transitions. [2019-11-19 23:36:52,164 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 715 transitions. Word has length 19 [2019-11-19 23:36:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:52,164 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 715 transitions. [2019-11-19 23:36:52,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 715 transitions. [2019-11-19 23:36:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 23:36:52,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:52,171 INFO L410 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] [2019-11-19 23:36:52,172 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:52,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash -450647822, now seen corresponding path program 1 times [2019-11-19 23:36:52,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:52,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088746066] [2019-11-19 23:36:52,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:52,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088746066] [2019-11-19 23:36:52,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:52,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:52,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127291964] [2019-11-19 23:36:52,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:52,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:52,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:52,255 INFO L87 Difference]: Start difference. First operand 528 states and 715 transitions. Second operand 3 states. [2019-11-19 23:36:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:52,546 INFO L93 Difference]: Finished difference Result 720 states and 972 transitions. [2019-11-19 23:36:52,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:52,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 23:36:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:52,551 INFO L225 Difference]: With dead ends: 720 [2019-11-19 23:36:52,551 INFO L226 Difference]: Without dead ends: 712 [2019-11-19 23:36:52,553 INFO L630 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 [2019-11-19 23:36:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-11-19 23:36:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 546. [2019-11-19 23:36:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-11-19 23:36:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 742 transitions. [2019-11-19 23:36:52,580 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 742 transitions. Word has length 22 [2019-11-19 23:36:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:52,580 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 742 transitions. [2019-11-19 23:36:52,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 742 transitions. [2019-11-19 23:36:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 23:36:52,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:52,583 INFO L410 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] [2019-11-19 23:36:52,584 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash 364241657, now seen corresponding path program 1 times [2019-11-19 23:36:52,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:52,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879078723] [2019-11-19 23:36:52,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:52,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879078723] [2019-11-19 23:36:52,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:52,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:52,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98427701] [2019-11-19 23:36:52,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:52,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:52,638 INFO L87 Difference]: Start difference. First operand 546 states and 742 transitions. Second operand 3 states. [2019-11-19 23:36:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:52,827 INFO L93 Difference]: Finished difference Result 572 states and 774 transitions. [2019-11-19 23:36:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:52,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 23:36:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:52,830 INFO L225 Difference]: With dead ends: 572 [2019-11-19 23:36:52,831 INFO L226 Difference]: Without dead ends: 567 [2019-11-19 23:36:52,832 INFO L630 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 [2019-11-19 23:36:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-11-19 23:36:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-11-19 23:36:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-11-19 23:36:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 769 transitions. [2019-11-19 23:36:52,859 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 769 transitions. Word has length 22 [2019-11-19 23:36:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:52,859 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 769 transitions. [2019-11-19 23:36:52,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 769 transitions. [2019-11-19 23:36:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 23:36:52,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:52,860 INFO L410 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] [2019-11-19 23:36:52,862 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:52,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:52,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1092839096, now seen corresponding path program 1 times [2019-11-19 23:36:52,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:52,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201449442] [2019-11-19 23:36:52,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:52,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201449442] [2019-11-19 23:36:52,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:52,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 23:36:52,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807788027] [2019-11-19 23:36:52,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:36:52,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:52,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:36:52,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:36:52,945 INFO L87 Difference]: Start difference. First operand 567 states and 769 transitions. Second operand 7 states. [2019-11-19 23:36:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:53,544 INFO L93 Difference]: Finished difference Result 863 states and 1148 transitions. [2019-11-19 23:36:53,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:36:53,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-19 23:36:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:53,548 INFO L225 Difference]: With dead ends: 863 [2019-11-19 23:36:53,549 INFO L226 Difference]: Without dead ends: 612 [2019-11-19 23:36:53,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:36:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-11-19 23:36:53,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 550. [2019-11-19 23:36:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-11-19 23:36:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 733 transitions. [2019-11-19 23:36:53,580 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 733 transitions. Word has length 23 [2019-11-19 23:36:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:53,581 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 733 transitions. [2019-11-19 23:36:53,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:36:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 733 transitions. [2019-11-19 23:36:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 23:36:53,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:53,582 INFO L410 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] [2019-11-19 23:36:53,583 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1575954452, now seen corresponding path program 1 times [2019-11-19 23:36:53,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:53,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304596687] [2019-11-19 23:36:53,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:53,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304596687] [2019-11-19 23:36:53,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:53,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:53,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889387765] [2019-11-19 23:36:53,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:53,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:53,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:53,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:53,615 INFO L87 Difference]: Start difference. First operand 550 states and 733 transitions. Second operand 4 states. [2019-11-19 23:36:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:53,665 INFO L93 Difference]: Finished difference Result 563 states and 747 transitions. [2019-11-19 23:36:53,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:53,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-19 23:36:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:53,669 INFO L225 Difference]: With dead ends: 563 [2019-11-19 23:36:53,669 INFO L226 Difference]: Without dead ends: 548 [2019-11-19 23:36:53,669 INFO L630 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 [2019-11-19 23:36:53,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-11-19 23:36:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-11-19 23:36:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-19 23:36:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 730 transitions. [2019-11-19 23:36:53,697 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 730 transitions. Word has length 23 [2019-11-19 23:36:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:53,698 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 730 transitions. [2019-11-19 23:36:53,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 730 transitions. [2019-11-19 23:36:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 23:36:53,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:53,699 INFO L410 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] [2019-11-19 23:36:53,700 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1184010678, now seen corresponding path program 1 times [2019-11-19 23:36:53,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:53,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037695896] [2019-11-19 23:36:53,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:53,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037695896] [2019-11-19 23:36:53,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:53,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:53,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262240887] [2019-11-19 23:36:53,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:53,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:53,727 INFO L87 Difference]: Start difference. First operand 548 states and 730 transitions. Second operand 3 states. [2019-11-19 23:36:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:53,924 INFO L93 Difference]: Finished difference Result 548 states and 730 transitions. [2019-11-19 23:36:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:53,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 23:36:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:53,929 INFO L225 Difference]: With dead ends: 548 [2019-11-19 23:36:53,929 INFO L226 Difference]: Without dead ends: 536 [2019-11-19 23:36:53,930 INFO L630 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 [2019-11-19 23:36:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-19 23:36:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-11-19 23:36:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-19 23:36:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 717 transitions. [2019-11-19 23:36:53,963 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 717 transitions. Word has length 25 [2019-11-19 23:36:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:53,964 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 717 transitions. [2019-11-19 23:36:53,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 717 transitions. [2019-11-19 23:36:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 23:36:53,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:53,966 INFO L410 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] [2019-11-19 23:36:53,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash -944626100, now seen corresponding path program 1 times [2019-11-19 23:36:53,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:53,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469946767] [2019-11-19 23:36:53,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:54,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469946767] [2019-11-19 23:36:54,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:54,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:54,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229439307] [2019-11-19 23:36:54,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:54,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:54,009 INFO L87 Difference]: Start difference. First operand 536 states and 717 transitions. Second operand 3 states. [2019-11-19 23:36:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:54,196 INFO L93 Difference]: Finished difference Result 744 states and 995 transitions. [2019-11-19 23:36:54,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:54,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-19 23:36:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:54,199 INFO L225 Difference]: With dead ends: 744 [2019-11-19 23:36:54,200 INFO L226 Difference]: Without dead ends: 538 [2019-11-19 23:36:54,200 INFO L630 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 [2019-11-19 23:36:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-19 23:36:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-19 23:36:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-19 23:36:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 720 transitions. [2019-11-19 23:36:54,232 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 720 transitions. Word has length 28 [2019-11-19 23:36:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:54,232 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 720 transitions. [2019-11-19 23:36:54,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 720 transitions. [2019-11-19 23:36:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 23:36:54,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:54,233 INFO L410 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] [2019-11-19 23:36:54,234 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:54,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:54,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1312752221, now seen corresponding path program 1 times [2019-11-19 23:36:54,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:54,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097145005] [2019-11-19 23:36:54,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:54,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097145005] [2019-11-19 23:36:54,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:54,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:54,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605636159] [2019-11-19 23:36:54,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:54,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:54,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:54,273 INFO L87 Difference]: Start difference. First operand 538 states and 720 transitions. Second operand 3 states. [2019-11-19 23:36:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:54,329 INFO L93 Difference]: Finished difference Result 718 states and 954 transitions. [2019-11-19 23:36:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:54,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 23:36:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:54,334 INFO L225 Difference]: With dead ends: 718 [2019-11-19 23:36:54,334 INFO L226 Difference]: Without dead ends: 514 [2019-11-19 23:36:54,335 INFO L630 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 [2019-11-19 23:36:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-19 23:36:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 498. [2019-11-19 23:36:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-11-19 23:36:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 662 transitions. [2019-11-19 23:36:54,367 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 662 transitions. Word has length 29 [2019-11-19 23:36:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:54,367 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 662 transitions. [2019-11-19 23:36:54,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 662 transitions. [2019-11-19 23:36:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 23:36:54,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:54,370 INFO L410 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] [2019-11-19 23:36:54,371 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash 259846608, now seen corresponding path program 1 times [2019-11-19 23:36:54,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:54,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496733417] [2019-11-19 23:36:54,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:54,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496733417] [2019-11-19 23:36:54,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:54,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:36:54,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939129616] [2019-11-19 23:36:54,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:36:54,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:54,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:36:54,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:54,450 INFO L87 Difference]: Start difference. First operand 498 states and 662 transitions. Second operand 5 states. [2019-11-19 23:36:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:54,792 INFO L93 Difference]: Finished difference Result 1289 states and 1713 transitions. [2019-11-19 23:36:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:36:54,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-19 23:36:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:54,798 INFO L225 Difference]: With dead ends: 1289 [2019-11-19 23:36:54,798 INFO L226 Difference]: Without dead ends: 1027 [2019-11-19 23:36:54,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:36:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-11-19 23:36:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 537. [2019-11-19 23:36:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-19 23:36:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 720 transitions. [2019-11-19 23:36:54,829 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 720 transitions. Word has length 32 [2019-11-19 23:36:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:54,829 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 720 transitions. [2019-11-19 23:36:54,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:36:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 720 transitions. [2019-11-19 23:36:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 23:36:54,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:54,831 INFO L410 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] [2019-11-19 23:36:54,831 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash 254877615, now seen corresponding path program 1 times [2019-11-19 23:36:54,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:54,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945441482] [2019-11-19 23:36:54,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:54,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945441482] [2019-11-19 23:36:54,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:54,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:36:54,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226237137] [2019-11-19 23:36:54,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:36:54,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:54,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:36:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:54,880 INFO L87 Difference]: Start difference. First operand 537 states and 720 transitions. Second operand 5 states. [2019-11-19 23:36:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:54,954 INFO L93 Difference]: Finished difference Result 553 states and 738 transitions. [2019-11-19 23:36:54,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:36:54,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-19 23:36:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:54,958 INFO L225 Difference]: With dead ends: 553 [2019-11-19 23:36:54,958 INFO L226 Difference]: Without dead ends: 527 [2019-11-19 23:36:54,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:36:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-11-19 23:36:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-11-19 23:36:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-11-19 23:36:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 705 transitions. [2019-11-19 23:36:54,985 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 705 transitions. Word has length 32 [2019-11-19 23:36:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:54,986 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 705 transitions. [2019-11-19 23:36:54,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:36:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 705 transitions. [2019-11-19 23:36:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 23:36:54,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:54,987 INFO L410 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] [2019-11-19 23:36:54,988 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:54,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:54,988 INFO L82 PathProgramCache]: Analyzing trace with hash 175699761, now seen corresponding path program 1 times [2019-11-19 23:36:54,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:54,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394850862] [2019-11-19 23:36:54,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:55,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394850862] [2019-11-19 23:36:55,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:55,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:55,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578107231] [2019-11-19 23:36:55,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:55,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:55,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:55,025 INFO L87 Difference]: Start difference. First operand 527 states and 705 transitions. Second operand 3 states. [2019-11-19 23:36:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:55,082 INFO L93 Difference]: Finished difference Result 787 states and 1044 transitions. [2019-11-19 23:36:55,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:55,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-19 23:36:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:55,086 INFO L225 Difference]: With dead ends: 787 [2019-11-19 23:36:55,086 INFO L226 Difference]: Without dead ends: 588 [2019-11-19 23:36:55,087 INFO L630 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 [2019-11-19 23:36:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-11-19 23:36:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 515. [2019-11-19 23:36:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-19 23:36:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 687 transitions. [2019-11-19 23:36:55,120 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 687 transitions. Word has length 33 [2019-11-19 23:36:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:55,120 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 687 transitions. [2019-11-19 23:36:55,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 687 transitions. [2019-11-19 23:36:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 23:36:55,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:55,122 INFO L410 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] [2019-11-19 23:36:55,123 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:55,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:55,123 INFO L82 PathProgramCache]: Analyzing trace with hash -744399452, now seen corresponding path program 1 times [2019-11-19 23:36:55,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:55,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116291595] [2019-11-19 23:36:55,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:55,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116291595] [2019-11-19 23:36:55,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:55,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:55,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320503069] [2019-11-19 23:36:55,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:55,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:55,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:55,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:55,154 INFO L87 Difference]: Start difference. First operand 515 states and 687 transitions. Second operand 3 states. [2019-11-19 23:36:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:55,354 INFO L93 Difference]: Finished difference Result 677 states and 892 transitions. [2019-11-19 23:36:55,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:55,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-19 23:36:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:55,359 INFO L225 Difference]: With dead ends: 677 [2019-11-19 23:36:55,359 INFO L226 Difference]: Without dead ends: 669 [2019-11-19 23:36:55,359 INFO L630 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 [2019-11-19 23:36:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-11-19 23:36:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 558. [2019-11-19 23:36:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-19 23:36:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 739 transitions. [2019-11-19 23:36:55,397 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 739 transitions. Word has length 33 [2019-11-19 23:36:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:55,398 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 739 transitions. [2019-11-19 23:36:55,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 739 transitions. [2019-11-19 23:36:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 23:36:55,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:55,400 INFO L410 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] [2019-11-19 23:36:55,400 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1584078547, now seen corresponding path program 1 times [2019-11-19 23:36:55,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:55,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870008600] [2019-11-19 23:36:55,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:55,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870008600] [2019-11-19 23:36:55,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:55,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:36:55,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998673491] [2019-11-19 23:36:55,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:36:55,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:36:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:36:55,455 INFO L87 Difference]: Start difference. First operand 558 states and 739 transitions. Second operand 5 states. [2019-11-19 23:36:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:55,806 INFO L93 Difference]: Finished difference Result 574 states and 753 transitions. [2019-11-19 23:36:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:36:55,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-19 23:36:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:55,809 INFO L225 Difference]: With dead ends: 574 [2019-11-19 23:36:55,810 INFO L226 Difference]: Without dead ends: 566 [2019-11-19 23:36:55,810 INFO L630 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 [2019-11-19 23:36:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-19 23:36:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 558. [2019-11-19 23:36:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-19 23:36:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 738 transitions. [2019-11-19 23:36:55,844 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 738 transitions. Word has length 34 [2019-11-19 23:36:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:55,845 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 738 transitions. [2019-11-19 23:36:55,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:36:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 738 transitions. [2019-11-19 23:36:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 23:36:55,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:55,846 INFO L410 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] [2019-11-19 23:36:55,846 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:55,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:55,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1675490409, now seen corresponding path program 1 times [2019-11-19 23:36:55,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:55,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686756288] [2019-11-19 23:36:55,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:55,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686756288] [2019-11-19 23:36:55,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:55,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:55,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560148812] [2019-11-19 23:36:55,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:55,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:55,871 INFO L87 Difference]: Start difference. First operand 558 states and 738 transitions. Second operand 3 states. [2019-11-19 23:36:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:55,925 INFO L93 Difference]: Finished difference Result 801 states and 1040 transitions. [2019-11-19 23:36:55,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:55,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-19 23:36:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:55,929 INFO L225 Difference]: With dead ends: 801 [2019-11-19 23:36:55,929 INFO L226 Difference]: Without dead ends: 680 [2019-11-19 23:36:55,930 INFO L630 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 [2019-11-19 23:36:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-19 23:36:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 559. [2019-11-19 23:36:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-11-19 23:36:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 739 transitions. [2019-11-19 23:36:55,966 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 739 transitions. Word has length 34 [2019-11-19 23:36:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:55,966 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 739 transitions. [2019-11-19 23:36:55,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 739 transitions. [2019-11-19 23:36:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 23:36:55,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:55,967 INFO L410 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] [2019-11-19 23:36:55,968 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -930533145, now seen corresponding path program 1 times [2019-11-19 23:36:55,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:55,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052848936] [2019-11-19 23:36:55,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:56,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052848936] [2019-11-19 23:36:56,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:56,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:56,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523317196] [2019-11-19 23:36:56,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:56,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:56,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:56,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:56,018 INFO L87 Difference]: Start difference. First operand 559 states and 739 transitions. Second operand 4 states. [2019-11-19 23:36:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:56,098 INFO L93 Difference]: Finished difference Result 1309 states and 1714 transitions. [2019-11-19 23:36:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:56,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-19 23:36:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:56,103 INFO L225 Difference]: With dead ends: 1309 [2019-11-19 23:36:56,103 INFO L226 Difference]: Without dead ends: 759 [2019-11-19 23:36:56,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-11-19 23:36:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 653. [2019-11-19 23:36:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-11-19 23:36:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 856 transitions. [2019-11-19 23:36:56,151 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 856 transitions. Word has length 34 [2019-11-19 23:36:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:56,151 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 856 transitions. [2019-11-19 23:36:56,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 856 transitions. [2019-11-19 23:36:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 23:36:56,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:56,153 INFO L410 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] [2019-11-19 23:36:56,153 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash -992572759, now seen corresponding path program 1 times [2019-11-19 23:36:56,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:56,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283787641] [2019-11-19 23:36:56,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:56,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283787641] [2019-11-19 23:36:56,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:56,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:56,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476689934] [2019-11-19 23:36:56,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:56,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:56,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:56,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:56,271 INFO L87 Difference]: Start difference. First operand 653 states and 856 transitions. Second operand 4 states. [2019-11-19 23:36:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:56,412 INFO L93 Difference]: Finished difference Result 842 states and 1099 transitions. [2019-11-19 23:36:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:56,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-19 23:36:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:56,417 INFO L225 Difference]: With dead ends: 842 [2019-11-19 23:36:56,417 INFO L226 Difference]: Without dead ends: 623 [2019-11-19 23:36:56,418 INFO L630 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 [2019-11-19 23:36:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-19 23:36:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 618. [2019-11-19 23:36:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-19 23:36:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 805 transitions. [2019-11-19 23:36:56,493 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 805 transitions. Word has length 34 [2019-11-19 23:36:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:56,493 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 805 transitions. [2019-11-19 23:36:56,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 805 transitions. [2019-11-19 23:36:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 23:36:56,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:56,495 INFO L410 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] [2019-11-19 23:36:56,496 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash -19681251, now seen corresponding path program 1 times [2019-11-19 23:36:56,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:56,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576091506] [2019-11-19 23:36:56,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:56,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576091506] [2019-11-19 23:36:56,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:56,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:56,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973488134] [2019-11-19 23:36:56,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:56,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:56,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:56,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:56,551 INFO L87 Difference]: Start difference. First operand 618 states and 805 transitions. Second operand 4 states. [2019-11-19 23:36:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:56,810 INFO L93 Difference]: Finished difference Result 626 states and 812 transitions. [2019-11-19 23:36:56,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:56,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-19 23:36:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:56,813 INFO L225 Difference]: With dead ends: 626 [2019-11-19 23:36:56,813 INFO L226 Difference]: Without dead ends: 567 [2019-11-19 23:36:56,814 INFO L630 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 [2019-11-19 23:36:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-11-19 23:36:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-11-19 23:36:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-11-19 23:36:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 728 transitions. [2019-11-19 23:36:56,865 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 728 transitions. Word has length 35 [2019-11-19 23:36:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:56,865 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 728 transitions. [2019-11-19 23:36:56,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 728 transitions. [2019-11-19 23:36:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 23:36:56,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:56,867 INFO L410 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] [2019-11-19 23:36:56,867 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:56,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash 813687739, now seen corresponding path program 1 times [2019-11-19 23:36:56,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:56,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923961913] [2019-11-19 23:36:56,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:56,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923961913] [2019-11-19 23:36:56,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:56,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:56,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311536547] [2019-11-19 23:36:56,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:56,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:56,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:56,911 INFO L87 Difference]: Start difference. First operand 567 states and 728 transitions. Second operand 4 states. [2019-11-19 23:36:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:57,071 INFO L93 Difference]: Finished difference Result 631 states and 801 transitions. [2019-11-19 23:36:57,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:57,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-19 23:36:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:57,074 INFO L225 Difference]: With dead ends: 631 [2019-11-19 23:36:57,074 INFO L226 Difference]: Without dead ends: 538 [2019-11-19 23:36:57,075 INFO L630 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 [2019-11-19 23:36:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-19 23:36:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 520. [2019-11-19 23:36:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-11-19 23:36:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 653 transitions. [2019-11-19 23:36:57,121 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 653 transitions. Word has length 35 [2019-11-19 23:36:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:57,122 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 653 transitions. [2019-11-19 23:36:57,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 653 transitions. [2019-11-19 23:36:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 23:36:57,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:57,123 INFO L410 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] [2019-11-19 23:36:57,123 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash -759040003, now seen corresponding path program 1 times [2019-11-19 23:36:57,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:57,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826147630] [2019-11-19 23:36:57,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:57,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826147630] [2019-11-19 23:36:57,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:57,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:36:57,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494812297] [2019-11-19 23:36:57,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:36:57,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:36:57,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:36:57,171 INFO L87 Difference]: Start difference. First operand 520 states and 653 transitions. Second operand 3 states. [2019-11-19 23:36:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:57,296 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2019-11-19 23:36:57,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:36:57,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-19 23:36:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:57,300 INFO L225 Difference]: With dead ends: 535 [2019-11-19 23:36:57,301 INFO L226 Difference]: Without dead ends: 521 [2019-11-19 23:36:57,301 INFO L630 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 [2019-11-19 23:36:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-11-19 23:36:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 516. [2019-11-19 23:36:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-19 23:36:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 647 transitions. [2019-11-19 23:36:57,346 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 647 transitions. Word has length 35 [2019-11-19 23:36:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:57,347 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 647 transitions. [2019-11-19 23:36:57,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:36:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 647 transitions. [2019-11-19 23:36:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 23:36:57,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:57,348 INFO L410 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] [2019-11-19 23:36:57,349 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:57,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:57,349 INFO L82 PathProgramCache]: Analyzing trace with hash 111409610, now seen corresponding path program 1 times [2019-11-19 23:36:57,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:57,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570477880] [2019-11-19 23:36:57,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:57,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570477880] [2019-11-19 23:36:57,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:57,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:36:57,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682588059] [2019-11-19 23:36:57,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:36:57,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:36:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:36:57,392 INFO L87 Difference]: Start difference. First operand 516 states and 647 transitions. Second operand 4 states. [2019-11-19 23:36:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:57,562 INFO L93 Difference]: Finished difference Result 697 states and 881 transitions. [2019-11-19 23:36:57,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:36:57,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-19 23:36:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:57,565 INFO L225 Difference]: With dead ends: 697 [2019-11-19 23:36:57,565 INFO L226 Difference]: Without dead ends: 513 [2019-11-19 23:36:57,565 INFO L630 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 [2019-11-19 23:36:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-19 23:36:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2019-11-19 23:36:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-11-19 23:36:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 638 transitions. [2019-11-19 23:36:57,629 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 638 transitions. Word has length 35 [2019-11-19 23:36:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:57,630 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 638 transitions. [2019-11-19 23:36:57,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:36:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 638 transitions. [2019-11-19 23:36:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 23:36:57,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:57,631 INFO L410 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] [2019-11-19 23:36:57,632 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:57,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2037935628, now seen corresponding path program 1 times [2019-11-19 23:36:57,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:57,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118046021] [2019-11-19 23:36:57,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:57,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118046021] [2019-11-19 23:36:57,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:57,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 23:36:57,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512402509] [2019-11-19 23:36:57,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:36:57,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:57,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:36:57,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:36:57,770 INFO L87 Difference]: Start difference. First operand 513 states and 638 transitions. Second operand 7 states. [2019-11-19 23:36:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:58,234 INFO L93 Difference]: Finished difference Result 753 states and 926 transitions. [2019-11-19 23:36:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:36:58,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-19 23:36:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:58,240 INFO L225 Difference]: With dead ends: 753 [2019-11-19 23:36:58,240 INFO L226 Difference]: Without dead ends: 733 [2019-11-19 23:36:58,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:36:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-11-19 23:36:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 512. [2019-11-19 23:36:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-19 23:36:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 636 transitions. [2019-11-19 23:36:58,313 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 636 transitions. Word has length 36 [2019-11-19 23:36:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:58,313 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 636 transitions. [2019-11-19 23:36:58,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:36:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 636 transitions. [2019-11-19 23:36:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-19 23:36:58,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:58,315 INFO L410 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] [2019-11-19 23:36:58,316 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:58,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash -187377312, now seen corresponding path program 1 times [2019-11-19 23:36:58,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:58,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298509370] [2019-11-19 23:36:58,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:58,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298509370] [2019-11-19 23:36:58,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:58,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 23:36:58,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875236746] [2019-11-19 23:36:58,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:36:58,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:36:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:36:58,403 INFO L87 Difference]: Start difference. First operand 512 states and 636 transitions. Second operand 6 states. [2019-11-19 23:36:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:58,778 INFO L93 Difference]: Finished difference Result 526 states and 649 transitions. [2019-11-19 23:36:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:36:58,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-19 23:36:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:58,782 INFO L225 Difference]: With dead ends: 526 [2019-11-19 23:36:58,783 INFO L226 Difference]: Without dead ends: 523 [2019-11-19 23:36:58,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:36:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-19 23:36:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 518. [2019-11-19 23:36:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-19 23:36:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 642 transitions. [2019-11-19 23:36:58,850 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 642 transitions. Word has length 37 [2019-11-19 23:36:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:36:58,850 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 642 transitions. [2019-11-19 23:36:58,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:36:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 642 transitions. [2019-11-19 23:36:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-19 23:36:58,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:36:58,852 INFO L410 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] [2019-11-19 23:36:58,853 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:36:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:36:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash -187389228, now seen corresponding path program 1 times [2019-11-19 23:36:58,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:36:58,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567239310] [2019-11-19 23:36:58,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:36:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:36:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:36:58,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567239310] [2019-11-19 23:36:58,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:36:58,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-19 23:36:58,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21717133] [2019-11-19 23:36:58,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:36:58,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:36:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:36:58,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:36:58,997 INFO L87 Difference]: Start difference. First operand 518 states and 642 transitions. Second operand 10 states. [2019-11-19 23:36:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:36:59,953 INFO L93 Difference]: Finished difference Result 791 states and 977 transitions. [2019-11-19 23:36:59,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:36:59,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-11-19 23:36:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:36:59,958 INFO L225 Difference]: With dead ends: 791 [2019-11-19 23:36:59,958 INFO L226 Difference]: Without dead ends: 772 [2019-11-19 23:36:59,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:36:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-11-19 23:37:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 758. [2019-11-19 23:37:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-11-19 23:37:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 945 transitions. [2019-11-19 23:37:00,047 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 945 transitions. Word has length 37 [2019-11-19 23:37:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:00,047 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 945 transitions. [2019-11-19 23:37:00,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:37:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 945 transitions. [2019-11-19 23:37:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-19 23:37:00,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:00,048 INFO L410 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] [2019-11-19 23:37:00,049 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:00,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1498161812, now seen corresponding path program 1 times [2019-11-19 23:37:00,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:00,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012055612] [2019-11-19 23:37:00,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:00,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012055612] [2019-11-19 23:37:00,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:00,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:37:00,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666766853] [2019-11-19 23:37:00,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:37:00,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:00,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:37:00,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:00,098 INFO L87 Difference]: Start difference. First operand 758 states and 945 transitions. Second operand 5 states. [2019-11-19 23:37:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:00,317 INFO L93 Difference]: Finished difference Result 763 states and 949 transitions. [2019-11-19 23:37:00,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:37:00,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-19 23:37:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:00,321 INFO L225 Difference]: With dead ends: 763 [2019-11-19 23:37:00,321 INFO L226 Difference]: Without dead ends: 740 [2019-11-19 23:37:00,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-11-19 23:37:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 499. [2019-11-19 23:37:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-11-19 23:37:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2019-11-19 23:37:00,377 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 37 [2019-11-19 23:37:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:00,377 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2019-11-19 23:37:00,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:37:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2019-11-19 23:37:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 23:37:00,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:00,378 INFO L410 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] [2019-11-19 23:37:00,379 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1021756590, now seen corresponding path program 1 times [2019-11-19 23:37:00,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:00,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28217078] [2019-11-19 23:37:00,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:00,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28217078] [2019-11-19 23:37:00,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:00,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:37:00,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609500104] [2019-11-19 23:37:00,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:00,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:00,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:00,405 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand 3 states. [2019-11-19 23:37:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:00,558 INFO L93 Difference]: Finished difference Result 856 states and 1060 transitions. [2019-11-19 23:37:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:00,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-19 23:37:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:00,562 INFO L225 Difference]: With dead ends: 856 [2019-11-19 23:37:00,562 INFO L226 Difference]: Without dead ends: 675 [2019-11-19 23:37:00,563 INFO L630 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 [2019-11-19 23:37:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-19 23:37:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 502. [2019-11-19 23:37:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-19 23:37:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 622 transitions. [2019-11-19 23:37:00,620 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 622 transitions. Word has length 38 [2019-11-19 23:37:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:00,620 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 622 transitions. [2019-11-19 23:37:00,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 622 transitions. [2019-11-19 23:37:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 23:37:00,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:00,622 INFO L410 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] [2019-11-19 23:37:00,622 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:00,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1329794158, now seen corresponding path program 1 times [2019-11-19 23:37:00,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:00,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693472882] [2019-11-19 23:37:00,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:00,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693472882] [2019-11-19 23:37:00,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:00,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:37:00,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421722189] [2019-11-19 23:37:00,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:37:00,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:00,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:37:00,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:00,682 INFO L87 Difference]: Start difference. First operand 502 states and 622 transitions. Second operand 5 states. [2019-11-19 23:37:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:00,938 INFO L93 Difference]: Finished difference Result 841 states and 1030 transitions. [2019-11-19 23:37:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:37:00,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-19 23:37:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:00,943 INFO L225 Difference]: With dead ends: 841 [2019-11-19 23:37:00,943 INFO L226 Difference]: Without dead ends: 685 [2019-11-19 23:37:00,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-11-19 23:37:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 502. [2019-11-19 23:37:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-19 23:37:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 618 transitions. [2019-11-19 23:37:01,008 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 618 transitions. Word has length 38 [2019-11-19 23:37:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:01,009 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 618 transitions. [2019-11-19 23:37:01,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:37:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 618 transitions. [2019-11-19 23:37:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 23:37:01,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:01,010 INFO L410 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] [2019-11-19 23:37:01,011 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash 595887759, now seen corresponding path program 1 times [2019-11-19 23:37:01,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:01,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900824797] [2019-11-19 23:37:01,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:01,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900824797] [2019-11-19 23:37:01,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:01,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:37:01,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957305603] [2019-11-19 23:37:01,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:37:01,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:01,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:37:01,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:01,085 INFO L87 Difference]: Start difference. First operand 502 states and 618 transitions. Second operand 5 states. [2019-11-19 23:37:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:01,421 INFO L93 Difference]: Finished difference Result 963 states and 1192 transitions. [2019-11-19 23:37:01,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:37:01,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-19 23:37:01,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:01,426 INFO L225 Difference]: With dead ends: 963 [2019-11-19 23:37:01,427 INFO L226 Difference]: Without dead ends: 833 [2019-11-19 23:37:01,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:37:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-11-19 23:37:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 502. [2019-11-19 23:37:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-19 23:37:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 617 transitions. [2019-11-19 23:37:01,494 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 617 transitions. Word has length 41 [2019-11-19 23:37:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:01,495 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 617 transitions. [2019-11-19 23:37:01,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:37:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 617 transitions. [2019-11-19 23:37:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 23:37:01,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:01,498 INFO L410 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] [2019-11-19 23:37:01,498 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash 768209966, now seen corresponding path program 1 times [2019-11-19 23:37:01,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:01,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828273853] [2019-11-19 23:37:01,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:01,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828273853] [2019-11-19 23:37:01,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:01,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 23:37:01,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653855530] [2019-11-19 23:37:01,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:37:01,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:37:01,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:01,550 INFO L87 Difference]: Start difference. First operand 502 states and 617 transitions. Second operand 7 states. [2019-11-19 23:37:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:01,816 INFO L93 Difference]: Finished difference Result 520 states and 635 transitions. [2019-11-19 23:37:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:37:01,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-19 23:37:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:01,818 INFO L225 Difference]: With dead ends: 520 [2019-11-19 23:37:01,819 INFO L226 Difference]: Without dead ends: 277 [2019-11-19 23:37:01,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:37:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-19 23:37:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 259. [2019-11-19 23:37:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-19 23:37:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-11-19 23:37:01,854 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 41 [2019-11-19 23:37:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:01,854 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-11-19 23:37:01,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:37:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-11-19 23:37:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 23:37:01,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:01,858 INFO L410 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] [2019-11-19 23:37:01,859 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:01,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1022149612, now seen corresponding path program 1 times [2019-11-19 23:37:01,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:01,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69188288] [2019-11-19 23:37:01,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:01,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69188288] [2019-11-19 23:37:01,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:01,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:37:01,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540332724] [2019-11-19 23:37:01,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:01,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:01,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:01,888 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 3 states. [2019-11-19 23:37:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:01,984 INFO L93 Difference]: Finished difference Result 392 states and 488 transitions. [2019-11-19 23:37:01,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:01,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-19 23:37:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:01,986 INFO L225 Difference]: With dead ends: 392 [2019-11-19 23:37:01,986 INFO L226 Difference]: Without dead ends: 221 [2019-11-19 23:37:01,988 INFO L630 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 [2019-11-19 23:37:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-19 23:37:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-19 23:37:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-19 23:37:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 269 transitions. [2019-11-19 23:37:02,018 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 269 transitions. Word has length 45 [2019-11-19 23:37:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:02,019 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 269 transitions. [2019-11-19 23:37:02,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 269 transitions. [2019-11-19 23:37:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 23:37:02,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:02,020 INFO L410 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] [2019-11-19 23:37:02,021 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1001845677, now seen corresponding path program 1 times [2019-11-19 23:37:02,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:02,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172112134] [2019-11-19 23:37:02,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:02,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172112134] [2019-11-19 23:37:02,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:02,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 23:37:02,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237725394] [2019-11-19 23:37:02,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:37:02,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:02,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:37:02,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:02,077 INFO L87 Difference]: Start difference. First operand 221 states and 269 transitions. Second operand 7 states. [2019-11-19 23:37:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:02,278 INFO L93 Difference]: Finished difference Result 324 states and 393 transitions. [2019-11-19 23:37:02,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:37:02,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-19 23:37:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:02,280 INFO L225 Difference]: With dead ends: 324 [2019-11-19 23:37:02,280 INFO L226 Difference]: Without dead ends: 306 [2019-11-19 23:37:02,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:37:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-19 23:37:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 227. [2019-11-19 23:37:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-19 23:37:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2019-11-19 23:37:02,314 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 50 [2019-11-19 23:37:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:02,314 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2019-11-19 23:37:02,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:37:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2019-11-19 23:37:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 23:37:02,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:02,316 INFO L410 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] [2019-11-19 23:37:02,316 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:02,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1793210190, now seen corresponding path program 1 times [2019-11-19 23:37:02,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:02,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97966641] [2019-11-19 23:37:02,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:02,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97966641] [2019-11-19 23:37:02,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:02,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-19 23:37:02,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48364119] [2019-11-19 23:37:02,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:37:02,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:02,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:37:02,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:37:02,430 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand 10 states. [2019-11-19 23:37:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:02,956 INFO L93 Difference]: Finished difference Result 334 states and 402 transitions. [2019-11-19 23:37:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 23:37:02,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-11-19 23:37:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:02,958 INFO L225 Difference]: With dead ends: 334 [2019-11-19 23:37:02,959 INFO L226 Difference]: Without dead ends: 329 [2019-11-19 23:37:02,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-19 23:37:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-19 23:37:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 239. [2019-11-19 23:37:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-19 23:37:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2019-11-19 23:37:02,994 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 51 [2019-11-19 23:37:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:02,994 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2019-11-19 23:37:02,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:37:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2019-11-19 23:37:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-19 23:37:02,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:02,996 INFO L410 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] [2019-11-19 23:37:03,000 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:03,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:03,001 INFO L82 PathProgramCache]: Analyzing trace with hash -605322947, now seen corresponding path program 1 times [2019-11-19 23:37:03,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:03,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998816580] [2019-11-19 23:37:03,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:03,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998816580] [2019-11-19 23:37:03,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:03,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 23:37:03,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287855842] [2019-11-19 23:37:03,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:37:03,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:03,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:37:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:03,079 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand 7 states. [2019-11-19 23:37:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:03,265 INFO L93 Difference]: Finished difference Result 329 states and 397 transitions. [2019-11-19 23:37:03,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:37:03,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-19 23:37:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:03,267 INFO L225 Difference]: With dead ends: 329 [2019-11-19 23:37:03,268 INFO L226 Difference]: Without dead ends: 311 [2019-11-19 23:37:03,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:37:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-19 23:37:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 221. [2019-11-19 23:37:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-19 23:37:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2019-11-19 23:37:03,301 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 52 [2019-11-19 23:37:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:03,301 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2019-11-19 23:37:03,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:37:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2019-11-19 23:37:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 23:37:03,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:03,302 INFO L410 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] [2019-11-19 23:37:03,303 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1288130732, now seen corresponding path program 1 times [2019-11-19 23:37:03,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:03,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515127501] [2019-11-19 23:37:03,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:03,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515127501] [2019-11-19 23:37:03,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:03,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-19 23:37:03,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060368840] [2019-11-19 23:37:03,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 23:37:03,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:03,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:37:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:37:03,440 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 11 states. [2019-11-19 23:37:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:04,040 INFO L93 Difference]: Finished difference Result 313 states and 379 transitions. [2019-11-19 23:37:04,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:37:04,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-11-19 23:37:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:04,042 INFO L225 Difference]: With dead ends: 313 [2019-11-19 23:37:04,043 INFO L226 Difference]: Without dead ends: 308 [2019-11-19 23:37:04,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:37:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-19 23:37:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2019-11-19 23:37:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-19 23:37:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 313 transitions. [2019-11-19 23:37:04,083 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 313 transitions. Word has length 55 [2019-11-19 23:37:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:04,083 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 313 transitions. [2019-11-19 23:37:04,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 23:37:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 313 transitions. [2019-11-19 23:37:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 23:37:04,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:04,084 INFO L410 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] [2019-11-19 23:37:04,085 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1637611017, now seen corresponding path program 1 times [2019-11-19 23:37:04,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:04,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473846713] [2019-11-19 23:37:04,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:04,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473846713] [2019-11-19 23:37:04,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:04,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 23:37:04,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788650477] [2019-11-19 23:37:04,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:37:04,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:04,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:37:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:37:04,159 INFO L87 Difference]: Start difference. First operand 256 states and 313 transitions. Second operand 8 states. [2019-11-19 23:37:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:04,322 INFO L93 Difference]: Finished difference Result 316 states and 382 transitions. [2019-11-19 23:37:04,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:37:04,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-19 23:37:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:04,324 INFO L225 Difference]: With dead ends: 316 [2019-11-19 23:37:04,325 INFO L226 Difference]: Without dead ends: 221 [2019-11-19 23:37:04,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:37:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-19 23:37:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-19 23:37:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-19 23:37:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 267 transitions. [2019-11-19 23:37:04,358 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 267 transitions. Word has length 56 [2019-11-19 23:37:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:04,358 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 267 transitions. [2019-11-19 23:37:04,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:37:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 267 transitions. [2019-11-19 23:37:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 23:37:04,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:04,359 INFO L410 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] [2019-11-19 23:37:04,360 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 464116678, now seen corresponding path program 1 times [2019-11-19 23:37:04,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:04,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689545780] [2019-11-19 23:37:04,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:04,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689545780] [2019-11-19 23:37:04,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:04,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:37:04,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925475700] [2019-11-19 23:37:04,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:37:04,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:04,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:37:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:37:04,394 INFO L87 Difference]: Start difference. First operand 221 states and 267 transitions. Second operand 4 states. [2019-11-19 23:37:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:04,437 INFO L93 Difference]: Finished difference Result 338 states and 416 transitions. [2019-11-19 23:37:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:37:04,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-19 23:37:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:04,439 INFO L225 Difference]: With dead ends: 338 [2019-11-19 23:37:04,439 INFO L226 Difference]: Without dead ends: 220 [2019-11-19 23:37:04,440 INFO L630 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 [2019-11-19 23:37:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-19 23:37:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-19 23:37:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-19 23:37:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 265 transitions. [2019-11-19 23:37:04,471 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 265 transitions. Word has length 56 [2019-11-19 23:37:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:04,472 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 265 transitions. [2019-11-19 23:37:04,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:37:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 265 transitions. [2019-11-19 23:37:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 23:37:04,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:04,473 INFO L410 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] [2019-11-19 23:37:04,473 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash 457581574, now seen corresponding path program 1 times [2019-11-19 23:37:04,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:04,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655371927] [2019-11-19 23:37:04,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:04,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655371927] [2019-11-19 23:37:04,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:04,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:37:04,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165218873] [2019-11-19 23:37:04,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:37:04,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:04,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:37:04,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:04,521 INFO L87 Difference]: Start difference. First operand 220 states and 265 transitions. Second operand 5 states. [2019-11-19 23:37:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:04,638 INFO L93 Difference]: Finished difference Result 374 states and 448 transitions. [2019-11-19 23:37:04,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:37:04,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-19 23:37:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:04,640 INFO L225 Difference]: With dead ends: 374 [2019-11-19 23:37:04,640 INFO L226 Difference]: Without dead ends: 323 [2019-11-19 23:37:04,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-19 23:37:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 187. [2019-11-19 23:37:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-19 23:37:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 218 transitions. [2019-11-19 23:37:04,670 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 218 transitions. Word has length 56 [2019-11-19 23:37:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:04,671 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 218 transitions. [2019-11-19 23:37:04,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:37:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 218 transitions. [2019-11-19 23:37:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 23:37:04,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:04,672 INFO L410 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] [2019-11-19 23:37:04,672 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash -337598258, now seen corresponding path program 1 times [2019-11-19 23:37:04,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:04,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106101519] [2019-11-19 23:37:04,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:04,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106101519] [2019-11-19 23:37:04,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:04,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:37:04,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339834075] [2019-11-19 23:37:04,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:37:04,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:04,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:37:04,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:04,715 INFO L87 Difference]: Start difference. First operand 187 states and 218 transitions. Second operand 5 states. [2019-11-19 23:37:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:04,828 INFO L93 Difference]: Finished difference Result 274 states and 321 transitions. [2019-11-19 23:37:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:37:04,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-19 23:37:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:04,831 INFO L225 Difference]: With dead ends: 274 [2019-11-19 23:37:04,831 INFO L226 Difference]: Without dead ends: 240 [2019-11-19 23:37:04,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-19 23:37:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 176. [2019-11-19 23:37:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-19 23:37:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 204 transitions. [2019-11-19 23:37:04,860 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 204 transitions. Word has length 56 [2019-11-19 23:37:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:04,860 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 204 transitions. [2019-11-19 23:37:04,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:37:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 204 transitions. [2019-11-19 23:37:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 23:37:04,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:04,861 INFO L410 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] [2019-11-19 23:37:04,862 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -3083472, now seen corresponding path program 1 times [2019-11-19 23:37:04,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:04,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894667966] [2019-11-19 23:37:04,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:04,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894667966] [2019-11-19 23:37:04,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:04,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 23:37:04,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808078992] [2019-11-19 23:37:04,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:37:04,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:37:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:37:04,925 INFO L87 Difference]: Start difference. First operand 176 states and 204 transitions. Second operand 6 states. [2019-11-19 23:37:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:05,053 INFO L93 Difference]: Finished difference Result 318 states and 372 transitions. [2019-11-19 23:37:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:37:05,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-19 23:37:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:05,055 INFO L225 Difference]: With dead ends: 318 [2019-11-19 23:37:05,055 INFO L226 Difference]: Without dead ends: 261 [2019-11-19 23:37:05,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:37:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-19 23:37:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 142. [2019-11-19 23:37:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-19 23:37:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2019-11-19 23:37:05,081 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 57 [2019-11-19 23:37:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:05,081 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2019-11-19 23:37:05,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:37:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2019-11-19 23:37:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-19 23:37:05,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:05,083 INFO L410 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] [2019-11-19 23:37:05,083 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:05,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2079543916, now seen corresponding path program 1 times [2019-11-19 23:37:05,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:05,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021079426] [2019-11-19 23:37:05,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:05,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021079426] [2019-11-19 23:37:05,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:05,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 23:37:05,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970162842] [2019-11-19 23:37:05,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:37:05,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:05,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:37:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:37:05,148 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand 7 states. [2019-11-19 23:37:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:05,388 INFO L93 Difference]: Finished difference Result 371 states and 439 transitions. [2019-11-19 23:37:05,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:37:05,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-19 23:37:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:05,391 INFO L225 Difference]: With dead ends: 371 [2019-11-19 23:37:05,391 INFO L226 Difference]: Without dead ends: 351 [2019-11-19 23:37:05,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:37:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-19 23:37:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 158. [2019-11-19 23:37:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-19 23:37:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 187 transitions. [2019-11-19 23:37:05,422 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 187 transitions. Word has length 70 [2019-11-19 23:37:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:05,422 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 187 transitions. [2019-11-19 23:37:05,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:37:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 187 transitions. [2019-11-19 23:37:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-19 23:37:05,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:05,424 INFO L410 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] [2019-11-19 23:37:05,424 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash 174460736, now seen corresponding path program 1 times [2019-11-19 23:37:05,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:05,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319182726] [2019-11-19 23:37:05,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:05,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319182726] [2019-11-19 23:37:05,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:05,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-19 23:37:05,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87767145] [2019-11-19 23:37:05,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 23:37:05,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:05,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 23:37:05,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:37:05,647 INFO L87 Difference]: Start difference. First operand 158 states and 187 transitions. Second operand 14 states. [2019-11-19 23:37:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:06,637 INFO L93 Difference]: Finished difference Result 378 states and 450 transitions. [2019-11-19 23:37:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 23:37:06,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-11-19 23:37:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:06,639 INFO L225 Difference]: With dead ends: 378 [2019-11-19 23:37:06,640 INFO L226 Difference]: Without dead ends: 373 [2019-11-19 23:37:06,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2019-11-19 23:37:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-19 23:37:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 194. [2019-11-19 23:37:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-19 23:37:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2019-11-19 23:37:06,693 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 71 [2019-11-19 23:37:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:06,694 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2019-11-19 23:37:06,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 23:37:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2019-11-19 23:37:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-19 23:37:06,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:06,695 INFO L410 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] [2019-11-19 23:37:06,696 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash 753051531, now seen corresponding path program 1 times [2019-11-19 23:37:06,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:06,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258347323] [2019-11-19 23:37:06,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:06,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258347323] [2019-11-19 23:37:06,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:06,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-19 23:37:06,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566814168] [2019-11-19 23:37:06,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 23:37:06,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:37:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:37:06,844 INFO L87 Difference]: Start difference. First operand 194 states and 233 transitions. Second operand 11 states. [2019-11-19 23:37:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:07,259 INFO L93 Difference]: Finished difference Result 381 states and 453 transitions. [2019-11-19 23:37:07,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 23:37:07,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-11-19 23:37:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:07,261 INFO L225 Difference]: With dead ends: 381 [2019-11-19 23:37:07,261 INFO L226 Difference]: Without dead ends: 283 [2019-11-19 23:37:07,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-11-19 23:37:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-19 23:37:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 158. [2019-11-19 23:37:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-19 23:37:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2019-11-19 23:37:07,294 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 72 [2019-11-19 23:37:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:07,295 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2019-11-19 23:37:07,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 23:37:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2019-11-19 23:37:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 23:37:07,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:07,296 INFO L410 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] [2019-11-19 23:37:07,297 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash -442561846, now seen corresponding path program 1 times [2019-11-19 23:37:07,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:07,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755624445] [2019-11-19 23:37:07,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:07,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755624445] [2019-11-19 23:37:07,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:07,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:37:07,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118666110] [2019-11-19 23:37:07,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:37:07,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:37:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:37:07,343 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 4 states. [2019-11-19 23:37:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:07,406 INFO L93 Difference]: Finished difference Result 211 states and 244 transitions. [2019-11-19 23:37:07,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:37:07,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-19 23:37:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:07,408 INFO L225 Difference]: With dead ends: 211 [2019-11-19 23:37:07,408 INFO L226 Difference]: Without dead ends: 191 [2019-11-19 23:37:07,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-19 23:37:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 158. [2019-11-19 23:37:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-19 23:37:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2019-11-19 23:37:07,439 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 75 [2019-11-19 23:37:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:07,439 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2019-11-19 23:37:07,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:37:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2019-11-19 23:37:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 23:37:07,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:07,440 INFO L410 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] [2019-11-19 23:37:07,441 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1515871797, now seen corresponding path program 1 times [2019-11-19 23:37:07,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:07,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087288919] [2019-11-19 23:37:07,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:07,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087288919] [2019-11-19 23:37:07,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:07,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 23:37:07,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977922464] [2019-11-19 23:37:07,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:37:07,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:07,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:37:07,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:37:07,510 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 6 states. [2019-11-19 23:37:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:07,632 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2019-11-19 23:37:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:37:07,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-11-19 23:37:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:07,634 INFO L225 Difference]: With dead ends: 271 [2019-11-19 23:37:07,634 INFO L226 Difference]: Without dead ends: 206 [2019-11-19 23:37:07,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:37:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-19 23:37:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 148. [2019-11-19 23:37:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-19 23:37:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2019-11-19 23:37:07,664 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 76 [2019-11-19 23:37:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:07,664 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2019-11-19 23:37:07,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:37:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2019-11-19 23:37:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 23:37:07,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:07,665 INFO L410 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] [2019-11-19 23:37:07,666 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1001878718, now seen corresponding path program 1 times [2019-11-19 23:37:07,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:07,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255818716] [2019-11-19 23:37:07,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:07,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255818716] [2019-11-19 23:37:07,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:07,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-19 23:37:07,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514905363] [2019-11-19 23:37:07,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 23:37:07,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 23:37:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:37:07,833 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 13 states. [2019-11-19 23:37:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:08,560 INFO L93 Difference]: Finished difference Result 398 states and 464 transitions. [2019-11-19 23:37:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 23:37:08,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-11-19 23:37:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:08,563 INFO L225 Difference]: With dead ends: 398 [2019-11-19 23:37:08,563 INFO L226 Difference]: Without dead ends: 393 [2019-11-19 23:37:08,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2019-11-19 23:37:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-19 23:37:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 262. [2019-11-19 23:37:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-19 23:37:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 304 transitions. [2019-11-19 23:37:08,616 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 304 transitions. Word has length 77 [2019-11-19 23:37:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:08,616 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 304 transitions. [2019-11-19 23:37:08,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 23:37:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 304 transitions. [2019-11-19 23:37:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 23:37:08,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:08,617 INFO L410 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] [2019-11-19 23:37:08,618 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1889101564, now seen corresponding path program 1 times [2019-11-19 23:37:08,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:08,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723079076] [2019-11-19 23:37:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:08,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723079076] [2019-11-19 23:37:08,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:08,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 23:37:08,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323416247] [2019-11-19 23:37:08,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:37:08,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:08,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:37:08,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:37:08,698 INFO L87 Difference]: Start difference. First operand 262 states and 304 transitions. Second operand 6 states. [2019-11-19 23:37:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:08,890 INFO L93 Difference]: Finished difference Result 442 states and 515 transitions. [2019-11-19 23:37:08,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:37:08,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-11-19 23:37:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:08,893 INFO L225 Difference]: With dead ends: 442 [2019-11-19 23:37:08,893 INFO L226 Difference]: Without dead ends: 422 [2019-11-19 23:37:08,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:37:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-11-19 23:37:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 255. [2019-11-19 23:37:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-19 23:37:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 293 transitions. [2019-11-19 23:37:08,944 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 293 transitions. Word has length 77 [2019-11-19 23:37:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:08,944 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 293 transitions. [2019-11-19 23:37:08,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:37:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 293 transitions. [2019-11-19 23:37:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 23:37:08,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:08,946 INFO L410 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] [2019-11-19 23:37:08,946 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash 633205197, now seen corresponding path program 1 times [2019-11-19 23:37:08,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:08,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902959719] [2019-11-19 23:37:08,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:09,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902959719] [2019-11-19 23:37:09,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:09,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-19 23:37:09,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297788697] [2019-11-19 23:37:09,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:37:09,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:37:09,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:37:09,058 INFO L87 Difference]: Start difference. First operand 255 states and 293 transitions. Second operand 10 states. [2019-11-19 23:37:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:09,365 INFO L93 Difference]: Finished difference Result 394 states and 456 transitions. [2019-11-19 23:37:09,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:37:09,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-19 23:37:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:09,367 INFO L225 Difference]: With dead ends: 394 [2019-11-19 23:37:09,367 INFO L226 Difference]: Without dead ends: 265 [2019-11-19 23:37:09,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:37:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-19 23:37:09,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 204. [2019-11-19 23:37:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-19 23:37:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2019-11-19 23:37:09,409 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 78 [2019-11-19 23:37:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:09,410 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2019-11-19 23:37:09,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:37:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2019-11-19 23:37:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-19 23:37:09,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:09,411 INFO L410 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] [2019-11-19 23:37:09,411 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:09,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1444108100, now seen corresponding path program 1 times [2019-11-19 23:37:09,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:09,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251585107] [2019-11-19 23:37:09,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:09,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251585107] [2019-11-19 23:37:09,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:09,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:37:09,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337510031] [2019-11-19 23:37:09,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:09,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:09,454 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand 3 states. [2019-11-19 23:37:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:09,522 INFO L93 Difference]: Finished difference Result 250 states and 278 transitions. [2019-11-19 23:37:09,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:09,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-19 23:37:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:09,524 INFO L225 Difference]: With dead ends: 250 [2019-11-19 23:37:09,524 INFO L226 Difference]: Without dead ends: 230 [2019-11-19 23:37:09,524 INFO L630 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 [2019-11-19 23:37:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-19 23:37:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2019-11-19 23:37:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-19 23:37:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2019-11-19 23:37:09,561 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 80 [2019-11-19 23:37:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:09,562 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2019-11-19 23:37:09,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2019-11-19 23:37:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 23:37:09,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:09,563 INFO L410 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] [2019-11-19 23:37:09,564 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:09,564 INFO L82 PathProgramCache]: Analyzing trace with hash -724637394, now seen corresponding path program 1 times [2019-11-19 23:37:09,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:09,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948997326] [2019-11-19 23:37:09,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:09,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948997326] [2019-11-19 23:37:09,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:09,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 23:37:09,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730099194] [2019-11-19 23:37:09,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:37:09,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:09,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:37:09,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:37:09,648 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand 8 states. [2019-11-19 23:37:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:09,805 INFO L93 Difference]: Finished difference Result 237 states and 267 transitions. [2019-11-19 23:37:09,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:37:09,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-19 23:37:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:09,806 INFO L225 Difference]: With dead ends: 237 [2019-11-19 23:37:09,806 INFO L226 Difference]: Without dead ends: 202 [2019-11-19 23:37:09,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:37:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-19 23:37:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-11-19 23:37:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-19 23:37:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2019-11-19 23:37:09,875 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 82 [2019-11-19 23:37:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:09,876 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2019-11-19 23:37:09,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:37:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2019-11-19 23:37:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 23:37:09,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:09,877 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 23:37:09,878 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash 202567582, now seen corresponding path program 1 times [2019-11-19 23:37:09,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:09,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351693835] [2019-11-19 23:37:09,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:10,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351693835] [2019-11-19 23:37:10,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411729705] [2019-11-19 23:37:10,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:10,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:37:10,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:37:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:10,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:37:10,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-11-19 23:37:10,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114632266] [2019-11-19 23:37:10,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:37:10,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:10,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:37:10,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:37:10,295 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand 4 states. [2019-11-19 23:37:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:10,361 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2019-11-19 23:37:10,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:37:10,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-19 23:37:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:10,363 INFO L225 Difference]: With dead ends: 235 [2019-11-19 23:37:10,363 INFO L226 Difference]: Without dead ends: 194 [2019-11-19 23:37:10,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:37:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-19 23:37:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-19 23:37:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-19 23:37:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2019-11-19 23:37:10,416 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 82 [2019-11-19 23:37:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:10,416 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2019-11-19 23:37:10,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:37:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2019-11-19 23:37:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 23:37:10,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:10,417 INFO L410 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] [2019-11-19 23:37:10,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:37:10,625 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash 503283850, now seen corresponding path program 1 times [2019-11-19 23:37:10,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:10,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793255159] [2019-11-19 23:37:10,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:10,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793255159] [2019-11-19 23:37:10,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:10,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-19 23:37:10,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115651605] [2019-11-19 23:37:10,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 23:37:10,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:37:10,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:37:10,750 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 11 states. [2019-11-19 23:37:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:11,119 INFO L93 Difference]: Finished difference Result 286 states and 313 transitions. [2019-11-19 23:37:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 23:37:11,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-11-19 23:37:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:11,121 INFO L225 Difference]: With dead ends: 286 [2019-11-19 23:37:11,121 INFO L226 Difference]: Without dead ends: 153 [2019-11-19 23:37:11,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2019-11-19 23:37:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-19 23:37:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 124. [2019-11-19 23:37:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-19 23:37:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2019-11-19 23:37:11,148 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 83 [2019-11-19 23:37:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:11,149 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2019-11-19 23:37:11,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 23:37:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2019-11-19 23:37:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-19 23:37:11,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:11,150 INFO L410 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] [2019-11-19 23:37:11,150 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -946121222, now seen corresponding path program 1 times [2019-11-19 23:37:11,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:11,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538940153] [2019-11-19 23:37:11,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:11,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538940153] [2019-11-19 23:37:11,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:11,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-19 23:37:11,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482286243] [2019-11-19 23:37:11,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:37:11,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:11,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:37:11,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:37:11,277 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 10 states. [2019-11-19 23:37:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:11,485 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2019-11-19 23:37:11,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:37:11,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-11-19 23:37:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:11,486 INFO L225 Difference]: With dead ends: 153 [2019-11-19 23:37:11,486 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:37:11,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:37:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:37:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:37:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:37:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:37:11,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2019-11-19 23:37:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:11,487 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:37:11,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:37:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:37:11,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:37:11,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:37:11,943 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 197 [2019-11-19 23:37:12,294 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 197 [2019-11-19 23:37:12,636 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 172 [2019-11-19 23:37:12,842 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 178 [2019-11-19 23:37:13,021 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 180 [2019-11-19 23:37:13,415 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 197 [2019-11-19 23:37:13,553 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 191 [2019-11-19 23:37:13,689 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 188 [2019-11-19 23:37:13,969 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 212 [2019-11-19 23:37:14,389 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 345 [2019-11-19 23:37:14,516 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 206 [2019-11-19 23:37:14,751 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 228 [2019-11-19 23:37:15,081 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 345 [2019-11-19 23:37:15,396 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 323 [2019-11-19 23:37:15,552 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 197 [2019-11-19 23:37:15,828 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 323 [2019-11-19 23:37:15,957 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 189 [2019-11-19 23:37:16,152 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 197 [2019-11-19 23:37:16,504 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 220 [2019-11-19 23:37:16,927 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 358 [2019-11-19 23:37:17,039 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 188 [2019-11-19 23:37:17,402 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 322 [2019-11-19 23:37:17,527 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 188 [2019-11-19 23:37:17,742 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 197 [2019-11-19 23:37:18,048 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 188 [2019-11-19 23:37:18,208 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 182 [2019-11-19 23:37:18,573 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-11-19 23:37:18,711 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-19 23:37:19,822 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 196 DAG size of output: 83 [2019-11-19 23:37:20,902 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 196 DAG size of output: 83 [2019-11-19 23:37:21,038 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-11-19 23:37:21,257 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-19 23:37:21,573 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 76 [2019-11-19 23:37:21,767 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2019-11-19 23:37:21,912 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-11-19 23:37:22,700 WARN L191 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 84 [2019-11-19 23:37:22,941 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2019-11-19 23:37:23,559 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 76 [2019-11-19 23:37:24,148 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 78 [2019-11-19 23:37:24,455 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-11-19 23:37:24,576 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2019-11-19 23:37:24,725 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-19 23:37:24,964 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-19 23:37:25,300 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 32 [2019-11-19 23:37:26,407 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 196 DAG size of output: 83 [2019-11-19 23:37:26,552 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-11-19 23:37:27,299 WARN L191 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 72 [2019-11-19 23:37:27,909 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 81 [2019-11-19 23:37:28,021 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-11-19 23:37:28,491 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 71 [2019-11-19 23:37:28,631 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-19 23:37:29,990 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 211 DAG size of output: 87 [2019-11-19 23:37:30,627 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-11-19 23:37:31,010 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2019-11-19 23:37:33,414 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 339 DAG size of output: 145 [2019-11-19 23:37:34,391 WARN L191 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 96 [2019-11-19 23:37:35,553 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 224 DAG size of output: 94 [2019-11-19 23:37:36,454 WARN L191 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 85 [2019-11-19 23:37:38,237 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 340 DAG size of output: 144 [2019-11-19 23:37:40,040 WARN L191 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 311 DAG size of output: 113 [2019-11-19 23:37:40,291 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-19 23:37:41,344 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 196 DAG size of output: 83 [2019-11-19 23:37:41,619 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2019-11-19 23:37:41,880 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 63 [2019-11-19 23:37:42,021 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-11-19 23:37:42,168 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-11-19 23:37:43,827 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 319 DAG size of output: 128 [2019-11-19 23:37:44,737 WARN L191 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 86 [2019-11-19 23:37:46,051 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 196 DAG size of output: 83 [2019-11-19 23:37:46,159 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-11-19 23:37:46,409 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-19 23:37:46,697 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 71 [2019-11-19 23:37:46,994 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-11-19 23:37:47,500 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 31 [2019-11-19 23:37:48,421 WARN L191 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 102 [2019-11-19 23:37:48,552 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-11-19 23:37:48,704 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-19 23:37:49,042 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2019-11-19 23:37:49,374 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-11-19 23:37:51,672 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 355 DAG size of output: 152 [2019-11-19 23:37:51,776 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-11-19 23:37:52,384 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 81 [2019-11-19 23:37:52,489 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-11-19 23:37:52,844 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-19 23:37:53,406 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-11-19 23:37:54,232 WARN L191 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 81 [2019-11-19 23:37:56,259 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 310 DAG size of output: 135 [2019-11-19 23:37:56,370 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-11-19 23:37:56,505 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 [2019-11-19 23:37:57,151 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 81 [2019-11-19 23:37:57,462 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-19 23:37:57,636 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-11-19 23:37:57,920 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 71 [2019-11-19 23:37:59,018 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 196 DAG size of output: 83 [2019-11-19 23:37:59,194 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-11-19 23:37:59,367 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-11-19 23:37:59,620 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 34 [2019-11-19 23:37:59,755 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2019-11-19 23:38:00,182 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2019-11-19 23:38:00,319 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 [2019-11-19 23:38:00,639 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2019-11-19 23:38:00,772 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 [2019-11-19 23:38:01,108 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2019-11-19 23:38:01,231 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2019-11-19 23:38:01,884 WARN L191 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 81 [2019-11-19 23:38:02,051 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-11-19 23:38:02,252 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-11-19 23:38:03,132 WARN L191 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2019-11-19 23:38:03,930 WARN L191 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-11-19 23:38:04,226 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 71 [2019-11-19 23:38:04,402 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-19 23:38:04,594 INFO L440 ceAbstractionStarter]: At program point L1026-1(lines 1021 1028) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (<= ~MaximumInterfaceType~0 0))) (or (and (and (= ~myStatus~0 0) .cse0 .cse1) .cse2 .cse3) (and (and (and .cse0 .cse1) (<= (+ ~myStatus~0 1073741637) 0)) .cse2 .cse3))) [2019-11-19 23:38:04,594 INFO L440 ceAbstractionStarter]: At program point L1026-2(lines 1021 1028) the Hoare annotation is: false [2019-11-19 23:38:04,594 INFO L440 ceAbstractionStarter]: At program point L1026-3(lines 1021 1028) the Hoare annotation is: false [2019-11-19 23:38:04,594 INFO L440 ceAbstractionStarter]: At program point L1026-4(lines 1021 1028) the Hoare annotation is: false [2019-11-19 23:38:04,594 INFO L440 ceAbstractionStarter]: At program point L1026-5(lines 1021 1028) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~myStatus~0 0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,595 INFO L440 ceAbstractionStarter]: At program point L1026-6(lines 1021 1028) the Hoare annotation is: false [2019-11-19 23:38:04,595 INFO L440 ceAbstractionStarter]: At program point L1026-7(lines 1021 1028) the Hoare annotation is: false [2019-11-19 23:38:04,595 INFO L440 ceAbstractionStarter]: At program point L1026-8(lines 1021 1028) the Hoare annotation is: false [2019-11-19 23:38:04,595 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,596 INFO L440 ceAbstractionStarter]: At program point L432(lines 161 434) the Hoare annotation is: (let ((.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse5 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (= 0 ~pended~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (= ~s~0 ~DC~0)) (.cse12 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse15 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse3 (and (and .cse13 (let ((.cse16 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse9 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse16) (and (and .cse5 .cse6 .cse7 .cse8) .cse12) .cse11 (<= 0 ~PagingReferenceCount~0) (<= .cse16 0) (<= (+ .cse17 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)) (<= ~PagingReferenceCount~0 0)))) .cse14 .cse15))) (let ((.cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (= 0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) .cse3)) (.cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse10 (= ~SKIP2~0 ~s~0))) (or (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741670) 0) .cse0 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0)) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3 .cse4) (and (= 0 |ULTIMATE.start_FloppyStartDevice_#res|) .cse1 .cse2 (and (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse0)) (and (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741637) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741637) 0) .cse0 (<= (+ ~myStatus~0 1073741637) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741637) 0)) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse6 .cse10 .cse7 .cse11 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (<= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse4 .cse12 (= ~lowerDriverReturn~0 0) .cse5 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (and .cse5 (= 0 (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823)) .cse8 .cse7 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0)) (and .cse9 .cse6 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse10 .cse7 .cse11 .cse12 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) .cse5 (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) .cse13 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0)) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (and .cse9 .cse5 .cse13 .cse10 .cse11 .cse7 .cse12) .cse14 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse15))))) [2019-11-19 23:38:04,596 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,596 INFO L440 ceAbstractionStarter]: At program point L1093(lines 1093 1114) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,596 INFO L440 ceAbstractionStarter]: At program point L763(lines 756 802) the Hoare annotation is: (let ((.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse12 (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0)) (.cse13 (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (= ~s~0 ~DC~0))) (let ((.cse0 (and (let ((.cse15 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse8 .cse10 (<= .cse15 0) (<= (+ .cse16 1) 0) (<= ~PagingReferenceCount~0 0) .cse11 .cse12 .cse13 .cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (and .cse6 .cse7) (<= 0 .cse15) (<= 0 ~PagingReferenceCount~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)))) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)))) (let ((.cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (= 0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (and (<= (+ ~DC~0 5) ~IPC~0) .cse0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= (+ ULTIMATE.start_main_~status~1 1073741637) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741637) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) .cse5 (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741637) 0) (<= (+ ~myStatus~0 1073741637) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741637) 0)) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse6 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse7) (and .cse8 (= ~lowerDriverReturn~0 0) .cse6 (<= |ULTIMATE.start_FloppyPnp_#res| 0) .cse9 .cse10 .cse3 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (<= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse4 .cse11) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse12 .cse13 .cse14 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (and .cse8 .cse6 .cse9 .cse10 .cse11) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and (= ~myStatus~0 0) .cse1 .cse2 .cse5 .cse3) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741670) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0) .cse5 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) (<= (+ ULTIMATE.start_main_~status~1 1073741670) 0)) (and (= 0 |ULTIMATE.start_FloppyStartDevice_#res|) .cse1 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse2 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse3 .cse5))))) [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962-1(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962-2(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962-3(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962-4(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962-5(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962-6(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L447 ceAbstractionStarter]: At program point L764(lines 748 803) the Hoare annotation is: true [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962-7(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L962-8(lines 962 979) no Hoare annotation was computed. [2019-11-19 23:38:04,597 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 308) no Hoare annotation was computed. [2019-11-19 23:38:04,598 INFO L440 ceAbstractionStarter]: At program point L1029(lines 1029 1070) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (and (let ((.cse5 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse6 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse5 0) (<= 1 ~compRegistered~0) (<= (+ .cse6 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse5) (= ~NP~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse6) 3221225494)) (< 0 ~PagingReferenceCount~0))) (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= ~MaximumInterfaceType~0 0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~myStatus~0 1073741637) 0) .cse4))) [2019-11-19 23:38:04,598 INFO L440 ceAbstractionStarter]: At program point L1029-1(lines 1029 1070) the Hoare annotation is: (let ((.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) (and (= ULTIMATE.start_main_~status~1 0) (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))))) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (and (= ~myStatus~0 0) .cse0) (<= ~MaximumInterfaceType~0 0)))) [2019-11-19 23:38:04,598 INFO L440 ceAbstractionStarter]: At program point L963(lines 962 979) the Hoare annotation is: (let ((.cse22 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse2 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse5 (<= ~PagingReferenceCount~0 1)) (.cse7 (<= .cse21 0)) (.cse11 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= (+ .cse22 1) 0)) (.cse12 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 .cse21)) (.cse18 (<= ~MaximumInterfaceType~0 0)) (.cse19 (= ~setEventCalled~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse13 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse17 .cse1 .cse6 .cse8 .cse9 .cse10 .cse12 .cse14 .cse16 .cse18 .cse19 .cse20)))) [2019-11-19 23:38:04,598 INFO L440 ceAbstractionStarter]: At program point L1029-2(lines 1029 1070) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,599 INFO L440 ceAbstractionStarter]: At program point L963-1(lines 962 979) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,599 INFO L440 ceAbstractionStarter]: At program point L1029-3(lines 1029 1070) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (<= 1 ~compRegistered~0) (= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,599 INFO L440 ceAbstractionStarter]: At program point L963-2(lines 962 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,599 INFO L440 ceAbstractionStarter]: At program point L963-3(lines 962 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,599 INFO L440 ceAbstractionStarter]: At program point L963-4(lines 962 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,600 INFO L440 ceAbstractionStarter]: At program point L963-5(lines 962 979) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,600 INFO L440 ceAbstractionStarter]: At program point L963-6(lines 962 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,600 INFO L444 ceAbstractionStarter]: For program point L765(lines 765 800) no Hoare annotation was computed. [2019-11-19 23:38:04,600 INFO L440 ceAbstractionStarter]: At program point L963-7(lines 962 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,600 INFO L440 ceAbstractionStarter]: At program point L963-8(lines 962 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,600 INFO L444 ceAbstractionStarter]: For program point L237-1(lines 230 418) no Hoare annotation was computed. [2019-11-19 23:38:04,601 INFO L444 ceAbstractionStarter]: For program point L766(lines 766 799) no Hoare annotation was computed. [2019-11-19 23:38:04,601 INFO L440 ceAbstractionStarter]: At program point L568(lines 529 594) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse3 (and (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse7 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse8 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse7) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse7 0) (<= (+ .cse8 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse8) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))))) (<= (+ ~DC~0 5) ~IPC~0)) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)))) (.cse4 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse5 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse6 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5 .cse6) (and .cse0 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse1 .cse3) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-19 23:38:04,601 INFO L440 ceAbstractionStarter]: At program point L965(lines 964 979) the Hoare annotation is: (let ((.cse22 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse2 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse5 (<= ~PagingReferenceCount~0 1)) (.cse7 (<= .cse21 0)) (.cse11 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= (+ .cse22 1) 0)) (.cse12 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 .cse21)) (.cse18 (<= ~MaximumInterfaceType~0 0)) (.cse19 (= ~setEventCalled~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse13 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse17 .cse1 .cse6 .cse8 .cse9 .cse10 .cse12 .cse14 .cse16 .cse18 .cse19 .cse20)))) [2019-11-19 23:38:04,602 INFO L440 ceAbstractionStarter]: At program point L965-1(lines 964 979) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse2 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))))) (or (and (and (= ~myStatus~0 0) .cse0) (<= ~MaximumInterfaceType~0 0)) (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)))) [2019-11-19 23:38:04,602 INFO L440 ceAbstractionStarter]: At program point L899(lines 899 919) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (<= (+ ~DC~0 5) ~IPC~0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse8 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse9 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse8) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse8 0) (<= (+ .cse9 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))))))) (.cse2 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse5 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse6 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse7 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse3) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 .cse7))) [2019-11-19 23:38:04,602 INFO L440 ceAbstractionStarter]: At program point L965-2(lines 964 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,603 INFO L440 ceAbstractionStarter]: At program point L965-3(lines 964 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,603 INFO L440 ceAbstractionStarter]: At program point L899-1(lines 899 919) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,603 INFO L440 ceAbstractionStarter]: At program point L965-4(lines 964 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,603 INFO L440 ceAbstractionStarter]: At program point L833(lines 833 853) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,604 INFO L440 ceAbstractionStarter]: At program point L965-5(lines 964 979) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~myStatus~0 0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,604 INFO L440 ceAbstractionStarter]: At program point L965-6(lines 964 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,604 INFO L444 ceAbstractionStarter]: For program point L767(lines 767 777) no Hoare annotation was computed. [2019-11-19 23:38:04,604 INFO L440 ceAbstractionStarter]: At program point L965-7(lines 964 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,604 INFO L440 ceAbstractionStarter]: At program point L965-8(lines 964 979) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,604 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 774) no Hoare annotation was computed. [2019-11-19 23:38:04,604 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 247) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point L1100(lines 1100 1112) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point L1034(lines 1034 1053) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point L1034-1(lines 1034 1053) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point L1034-2(lines 1034 1053) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point L1034-3(lines 1034 1053) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 643) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point L638-2(lines 638 643) no Hoare annotation was computed. [2019-11-19 23:38:04,605 INFO L440 ceAbstractionStarter]: At program point L1101(lines 1100 1112) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,605 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,606 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1040) no Hoare annotation was computed. [2019-11-19 23:38:04,606 INFO L444 ceAbstractionStarter]: For program point L1035-2(lines 1035 1040) no Hoare annotation was computed. [2019-11-19 23:38:04,606 INFO L444 ceAbstractionStarter]: For program point L1035-4(lines 1035 1040) no Hoare annotation was computed. [2019-11-19 23:38:04,606 INFO L444 ceAbstractionStarter]: For program point L1035-6(lines 1035 1040) no Hoare annotation was computed. [2019-11-19 23:38:04,606 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 580) no Hoare annotation was computed. [2019-11-19 23:38:04,606 INFO L444 ceAbstractionStarter]: For program point L573-2(lines 573 580) no Hoare annotation was computed. [2019-11-19 23:38:04,606 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,607 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 117) no Hoare annotation was computed. [2019-11-19 23:38:04,607 INFO L440 ceAbstractionStarter]: At program point L1103(lines 1102 1112) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,607 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,607 INFO L444 ceAbstractionStarter]: For program point L905(lines 905 917) no Hoare annotation was computed. [2019-11-19 23:38:04,607 INFO L444 ceAbstractionStarter]: For program point L905-1(lines 905 917) no Hoare annotation was computed. [2019-11-19 23:38:04,608 INFO L444 ceAbstractionStarter]: For program point L839(lines 839 851) no Hoare annotation was computed. [2019-11-19 23:38:04,608 INFO L440 ceAbstractionStarter]: At program point L906(lines 905 917) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (<= (+ ~DC~0 5) ~IPC~0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse8 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse9 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse8) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse8 0) (<= (+ .cse9 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))))))) (.cse2 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse5 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse6 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse7 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse3) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 .cse7))) [2019-11-19 23:38:04,608 INFO L440 ceAbstractionStarter]: At program point L906-1(lines 905 917) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,608 INFO L440 ceAbstractionStarter]: At program point L840(lines 839 851) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,609 INFO L440 ceAbstractionStarter]: At program point L708(lines 702 806) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse17 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (= 0 ~pended~0)) (.cse12 (= ~s~0 ~DC~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0)) (.cse16 (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse18 (let ((.cse19 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse0 .cse17 (and .cse6 .cse13 .cse12) .cse3 (<= .cse19 0) (<= (+ .cse20 1) 0) (<= ~PagingReferenceCount~0 0) .cse8 .cse14 .cse15 .cse16 .cse7 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse19) (<= 0 ~PagingReferenceCount~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494)))))) (let ((.cse11 (and .cse18 (<= (+ ~DC~0 5) ~IPC~0))) (.cse1 (and .cse6 .cse13 .cse8)) (.cse2 (= ~SKIP2~0 ~s~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (= 0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 (= ~lowerDriverReturn~0 0) .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| 0) .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (<= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse5) (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse8) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (and (= 0 |ULTIMATE.start_FloppyStartDevice_#res|) .cse9 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse10 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse11 .cse4) (and .cse6 (= 0 (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823)) (= 0 (+ ULTIMATE.start_main_~status~1 1073741823)) .cse12 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0)) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse6 .cse13 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse12) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741670) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0) .cse11 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) (<= (+ ULTIMATE.start_main_~status~1 1073741670) 0)) (and (= ~myStatus~0 0) .cse9 .cse10 .cse11 .cse4) (and (<= (+ ULTIMATE.start_main_~status~1 1073741637) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741637) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) .cse11 (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741637) 0) (<= (+ ~myStatus~0 1073741637) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741637) 0)) (and .cse14 .cse15 (and .cse0 .cse1 .cse2 .cse3) .cse16 .cse7 .cse17 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse9 .cse10 .cse4 .cse18 .cse5))))) [2019-11-19 23:38:04,609 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,609 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,609 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 384) no Hoare annotation was computed. [2019-11-19 23:38:04,610 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,610 INFO L440 ceAbstractionStarter]: At program point L908(lines 907 917) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (<= (+ ~DC~0 5) ~IPC~0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse8 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse9 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse8) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse8 0) (<= (+ .cse9 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))))))) (.cse2 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse5 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse6 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse7 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse3) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 .cse7))) [2019-11-19 23:38:04,610 INFO L440 ceAbstractionStarter]: At program point L908-1(lines 907 917) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,611 INFO L440 ceAbstractionStarter]: At program point L842(lines 841 851) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,611 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,611 INFO L440 ceAbstractionStarter]: At program point L645(lines 613 647) the Hoare annotation is: (let ((.cse0 (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse3 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse4 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (and (= 0 ~pended~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= ~PagingReferenceCount~0 1) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse3) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse3 0) (<= (+ .cse4 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse4) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~DC~0 5) ~IPC~0)))) (or (and .cse0 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0)) (and (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) .cse0 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) (<= (+ ~myStatus~0 1073741637) 0)) (and (let ((.cse1 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse2 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2) (and (not (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (and .cse0 .cse1 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse2)))) (<= ~MaximumInterfaceType~0 0)))) [2019-11-19 23:38:04,611 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 518) no Hoare annotation was computed. [2019-11-19 23:38:04,612 INFO L444 ceAbstractionStarter]: For program point L513-2(lines 513 518) no Hoare annotation was computed. [2019-11-19 23:38:04,612 INFO L440 ceAbstractionStarter]: At program point L1042(lines 1034 1053) the Hoare annotation is: (let ((.cse0 (let ((.cse5 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse4 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= .cse4 0) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (= ~NP~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse5) 3221225494)) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0) (<= (+ .cse5 1) 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 .cse4) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0)))) (.cse1 (<= (+ |ULTIMATE.start_IofCallDriver_#res| 1073741823) 0)) (.cse2 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741823) 0)) (.cse3 (<= ~MaximumInterfaceType~0 0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3))) [2019-11-19 23:38:04,612 INFO L440 ceAbstractionStarter]: At program point L1042-1(lines 1034 1053) the Hoare annotation is: false [2019-11-19 23:38:04,612 INFO L440 ceAbstractionStarter]: At program point L1042-2(lines 1034 1053) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,613 INFO L440 ceAbstractionStarter]: At program point L1042-3(lines 1034 1053) the Hoare annotation is: false [2019-11-19 23:38:04,613 INFO L440 ceAbstractionStarter]: At program point L977(lines 941 1005) the Hoare annotation is: (let ((.cse29 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse28 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse27 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse4 (<= ~PagingReferenceCount~0 1)) (.cse5 (<= .cse28 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse29) 3221225494))) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (<= 1 ~compRegistered~0)) (.cse14 (<= (+ .cse29 1) 0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse18 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse19 (<= 0 .cse28)) (.cse21 (= ~setEventCalled~0 1)) (.cse22 (< 0 ~PagingReferenceCount~0))) (let ((.cse23 (and .cse0 .cse27 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse19 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse21 .cse22)) (.cse25 (and .cse0 .cse10 .cse27 .cse3 .cse2 .cse4 .cse11 .cse12 .cse5 .cse13 .cse14 .cse6 .cse16 .cse7 .cse18 .cse8 .cse19 .cse9 .cse21 .cse22)) (.cse1 (= ~myStatus~0 0)) (.cse26 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse24 (<= (+ ~myStatus~0 1073741637) 0)) (.cse15 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse17 (= ~lowerDriverReturn~0 0)) (.cse20 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse20) (and .cse1 .cse23 .cse20) (and .cse25 .cse24 .cse26 .cse20) (and .cse25 .cse1 .cse26 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))))) [2019-11-19 23:38:04,614 INFO L440 ceAbstractionStarter]: At program point L977-1(lines 941 1005) the Hoare annotation is: (let ((.cse23 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse24 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse2 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse7 (= ~s~0 ~MPR1~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (<= (+ ~DC~0 5) ~IPC~0)) (.cse9 (= 0 ~pended~0)) (.cse10 (<= ~PagingReferenceCount~0 1)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= .cse24 0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (<= 1 ~compRegistered~0)) (.cse14 (<= (+ .cse23 1) 0)) (.cse15 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse5 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse17 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse19 (<= 0 .cse24)) (.cse20 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse23) 3221225494))) (.cse21 (= ~setEventCalled~0 1)) (.cse22 (< 0 ~PagingReferenceCount~0))) (let ((.cse0 (and .cse7 .cse8 .cse4 .cse9 .cse10 .cse11 .cse12 .cse6 .cse13 .cse14 .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse20 .cse21 .cse22)) (.cse3 (and .cse4 (and .cse5 .cse6 (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))))) (.cse1 (<= ~MaximumInterfaceType~0 0))) (or (and (and (= ~myStatus~0 0) .cse0) .cse1) (and .cse2 .cse3) (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and .cse3 .cse1))))) [2019-11-19 23:38:04,614 INFO L440 ceAbstractionStarter]: At program point L977-2(lines 941 1005) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= ~PagingReferenceCount~0 1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= (+ ~NP~0 2) ~s~0)) (.cse5 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~s~0 2) ~MPR1~0)) (.cse8 (< 0 ~PagingReferenceCount~0)) (.cse9 (= ~SKIP1~0 ~s~0))) (or (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~DC~0 2) ~SKIP2~0) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse4 .cse5 (= ~lowerDriverReturn~0 0) .cse6 .cse7 .cse8 .cse9))) [2019-11-19 23:38:04,614 INFO L440 ceAbstractionStarter]: At program point L977-3(lines 941 1005) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,614 INFO L440 ceAbstractionStarter]: At program point L977-4(lines 941 1005) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,615 INFO L440 ceAbstractionStarter]: At program point L977-5(lines 941 1005) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse0 (= ~s~0 ~MPR1~0)) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse3 (= 0 ~pended~0)) (.cse4 (<= ~PagingReferenceCount~0 1)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= .cse21 0)) (.cse12 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (<= 1 ~compRegistered~0)) (.cse14 (<= (+ .cse20 1) 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse16 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse8 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse21)) (.cse9 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse18 (= ~setEventCalled~0 1)) (.cse19 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse18 .cse19) (and .cse15 .cse2 (or (and .cse0 .cse10 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 (= ~lowerDriverReturn~0 0) .cse7 .cse16 .cse8 .cse17 .cse9 .cse18 .cse19) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse6 .cse7 .cse16 .cse8 .cse17 .cse9 .cse18 .cse19)))))) [2019-11-19 23:38:04,615 INFO L440 ceAbstractionStarter]: At program point L977-6(lines 941 1005) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,616 INFO L440 ceAbstractionStarter]: At program point L779(lines 766 799) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~DC~0)) (.cse3 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse11 (and (let ((.cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse13 (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0)) (.cse14 (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|))) (or (and .cse12 .cse13 .cse14 .cse15 (and (and (and .cse1 .cse2) .cse8) .cse3 .cse5)) (and .cse3 .cse15 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse4 .cse5 .cse8 .cse12 .cse13 .cse1 .cse14 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)))) (<= (+ ~DC~0 2) ~SKIP2~0)))) (let ((.cse0 (and .cse11 (<= (+ ~DC~0 5) ~IPC~0))) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (= 0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| ~s~0 1073741642) ~IPC~0) (<= (+ ~s~0 ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741642) ~IPC~0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| ~s~0 1073741642) ~IPC~0) (<= (+ ULTIMATE.start_main_~status~1 1073741642) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 ~DC~0 1073741642) ~IPC~0) (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ~DC~0 1073741642) ~IPC~0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| ~DC~0 1073741642) ~IPC~0) .cse0 (<= (+ ~myStatus~0 ~DC~0 1073741642) ~IPC~0)) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse1 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse2) (and .cse3 (= ~lowerDriverReturn~0 0) .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| 0) .cse4 .cse5 .cse6 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (<= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse7 .cse8) (and (= 0 |ULTIMATE.start_FloppyStartDevice_#res|) .cse9 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse10 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse6 .cse0) (and (<= (+ ULTIMATE.start_main_~status~1 1073741637) 0) (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741637) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) (<= (+ ~myStatus~0 1073741637) 0) .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741637) 0)) (and .cse4 .cse11) (and (<= (+ ULTIMATE.start_main_~status~1 1073741675) 0) (<= (+ ~s~0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741675) ~IPC~0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| ~s~0 1073741675) ~IPC~0) .cse0 (<= (+ |ULTIMATE.start_FloppyPnp_#res| ~s~0 1073741675) ~IPC~0) (<= (+ ~s~0 ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741675) ~IPC~0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| ~DC~0 1073741675) ~IPC~0)) (and .cse11 (<= (+ |ULTIMATE.start_FloppyPnp_#res| ~s~0 1073741828) ~IPC~0) (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 ~DC~0 1073741828) ~IPC~0) (<= (+ ULTIMATE.start_main_~status~1 1073741828) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 ~DC~0 1073741828) ~IPC~0)) (and (= ~myStatus~0 0) .cse9 .cse10 .cse6 .cse0) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741670) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0) (<= (+ ULTIMATE.start_main_~status~1 1073741670) 0)) (and .cse9 .cse10 .cse6 .cse11 .cse7))))) [2019-11-19 23:38:04,616 INFO L440 ceAbstractionStarter]: At program point L977-7(lines 941 1005) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,616 INFO L440 ceAbstractionStarter]: At program point L977-8(lines 941 1005) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,617 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 149) no Hoare annotation was computed. [2019-11-19 23:38:04,617 INFO L444 ceAbstractionStarter]: For program point L119-2(lines 111 159) no Hoare annotation was computed. [2019-11-19 23:38:04,617 INFO L444 ceAbstractionStarter]: For program point L781(lines 781 783) no Hoare annotation was computed. [2019-11-19 23:38:04,617 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,617 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 332) no Hoare annotation was computed. [2019-11-19 23:38:04,617 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-11-19 23:38:04,618 INFO L444 ceAbstractionStarter]: For program point L122-2(lines 122 124) no Hoare annotation was computed. [2019-11-19 23:38:04,618 INFO L444 ceAbstractionStarter]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2019-11-19 23:38:04,618 INFO L440 ceAbstractionStarter]: At program point L1047-1(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (and (let ((.cse5 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse6 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse5 0) (<= 1 ~compRegistered~0) (<= (+ .cse6 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse5) (= ~NP~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse6) 3221225494)) (< 0 ~PagingReferenceCount~0))) (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= ~MaximumInterfaceType~0 0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~myStatus~0 1073741637) 0) .cse4))) [2019-11-19 23:38:04,618 INFO L444 ceAbstractionStarter]: For program point L1047-2(lines 1047 1051) no Hoare annotation was computed. [2019-11-19 23:38:04,619 INFO L440 ceAbstractionStarter]: At program point L1047-3(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) (and (= ULTIMATE.start_main_~status~1 0) (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))))) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (and (= ~myStatus~0 0) .cse0) (<= ~MaximumInterfaceType~0 0)))) [2019-11-19 23:38:04,619 INFO L444 ceAbstractionStarter]: For program point L1047-4(lines 1047 1051) no Hoare annotation was computed. [2019-11-19 23:38:04,619 INFO L440 ceAbstractionStarter]: At program point L1047-5(lines 1047 1051) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,619 INFO L444 ceAbstractionStarter]: For program point L1047-6(lines 1047 1051) no Hoare annotation was computed. [2019-11-19 23:38:04,620 INFO L440 ceAbstractionStarter]: At program point L1047-7(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (<= 1 ~compRegistered~0) (= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,620 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 720) no Hoare annotation was computed. [2019-11-19 23:38:04,620 INFO L444 ceAbstractionStarter]: For program point L717-2(lines 717 720) no Hoare annotation was computed. [2019-11-19 23:38:04,620 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 590) no Hoare annotation was computed. [2019-11-19 23:38:04,620 INFO L444 ceAbstractionStarter]: For program point L585-2(lines 585 590) no Hoare annotation was computed. [2019-11-19 23:38:04,620 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:38:04,621 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,621 INFO L440 ceAbstractionStarter]: At program point L1115(lines 1115 1135) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,621 INFO L444 ceAbstractionStarter]: For program point L785(lines 785 797) no Hoare annotation was computed. [2019-11-19 23:38:04,621 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,621 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,622 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 790) no Hoare annotation was computed. [2019-11-19 23:38:04,622 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,622 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,622 INFO L444 ceAbstractionStarter]: For program point L985-1(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,622 INFO L444 ceAbstractionStarter]: For program point L985-2(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,622 INFO L444 ceAbstractionStarter]: For program point L985-3(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,622 INFO L444 ceAbstractionStarter]: For program point L985-4(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,623 INFO L444 ceAbstractionStarter]: For program point L985-5(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,623 INFO L444 ceAbstractionStarter]: For program point L985-6(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,623 INFO L444 ceAbstractionStarter]: For program point L985-7(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,623 INFO L444 ceAbstractionStarter]: For program point L985-8(lines 985 1002) no Hoare annotation was computed. [2019-11-19 23:38:04,623 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,623 INFO L444 ceAbstractionStarter]: For program point L325(lines 325 331) no Hoare annotation was computed. [2019-11-19 23:38:04,624 INFO L440 ceAbstractionStarter]: At program point L325-1(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~myStatus~0 0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,624 INFO L444 ceAbstractionStarter]: For program point L986(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,624 INFO L444 ceAbstractionStarter]: For program point L986-3(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,624 INFO L440 ceAbstractionStarter]: At program point L854(lines 854 876) the Hoare annotation is: false [2019-11-19 23:38:04,624 INFO L444 ceAbstractionStarter]: For program point L986-6(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,624 INFO L444 ceAbstractionStarter]: For program point L986-9(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,625 INFO L444 ceAbstractionStarter]: For program point L986-12(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,625 INFO L444 ceAbstractionStarter]: For program point L986-15(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,625 INFO L444 ceAbstractionStarter]: For program point L986-18(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,625 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-11-19 23:38:04,625 INFO L444 ceAbstractionStarter]: For program point L392-2(lines 230 418) no Hoare annotation was computed. [2019-11-19 23:38:04,625 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,626 INFO L444 ceAbstractionStarter]: For program point L986-21(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,626 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 196) no Hoare annotation was computed. [2019-11-19 23:38:04,626 INFO L444 ceAbstractionStarter]: For program point L986-24(lines 986 992) no Hoare annotation was computed. [2019-11-19 23:38:04,626 INFO L444 ceAbstractionStarter]: For program point L194-2(lines 194 196) no Hoare annotation was computed. [2019-11-19 23:38:04,626 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 292) no Hoare annotation was computed. [2019-11-19 23:38:04,626 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,627 INFO L444 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,627 INFO L444 ceAbstractionStarter]: For program point L63-2(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,627 INFO L444 ceAbstractionStarter]: For program point L63-3(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,627 INFO L444 ceAbstractionStarter]: For program point L63-4(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,627 INFO L444 ceAbstractionStarter]: For program point L63-5(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,627 INFO L444 ceAbstractionStarter]: For program point L63-6(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,627 INFO L444 ceAbstractionStarter]: For program point L63-7(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,628 INFO L444 ceAbstractionStarter]: For program point L63-8(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,628 INFO L444 ceAbstractionStarter]: For program point L63-9(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,628 INFO L444 ceAbstractionStarter]: For program point L63-10(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,628 INFO L444 ceAbstractionStarter]: For program point L63-11(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,628 INFO L444 ceAbstractionStarter]: For program point L63-12(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,628 INFO L444 ceAbstractionStarter]: For program point L63-13(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,629 INFO L444 ceAbstractionStarter]: For program point L63-14(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,629 INFO L444 ceAbstractionStarter]: For program point L63-15(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,629 INFO L444 ceAbstractionStarter]: For program point L63-16(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,629 INFO L444 ceAbstractionStarter]: For program point L63-17(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,629 INFO L444 ceAbstractionStarter]: For program point L63-18(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,629 INFO L444 ceAbstractionStarter]: For program point L63-19(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,629 INFO L444 ceAbstractionStarter]: For program point L63-20(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,630 INFO L444 ceAbstractionStarter]: For program point L63-21(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,630 INFO L444 ceAbstractionStarter]: For program point L63-22(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,630 INFO L444 ceAbstractionStarter]: For program point L63-23(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,630 INFO L444 ceAbstractionStarter]: For program point L63-24(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,630 INFO L444 ceAbstractionStarter]: For program point L63-25(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,630 INFO L444 ceAbstractionStarter]: For program point L63-26(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,630 INFO L444 ceAbstractionStarter]: For program point L63-27(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,631 INFO L444 ceAbstractionStarter]: For program point L63-28(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,631 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 137) no Hoare annotation was computed. [2019-11-19 23:38:04,631 INFO L444 ceAbstractionStarter]: For program point L63-29(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,631 INFO L444 ceAbstractionStarter]: For program point L1121(lines 1121 1133) no Hoare annotation was computed. [2019-11-19 23:38:04,631 INFO L444 ceAbstractionStarter]: For program point L63-30(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,631 INFO L440 ceAbstractionStarter]: At program point L64(lines 1007 1020) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-19 23:38:04,632 INFO L444 ceAbstractionStarter]: For program point L63-31(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,632 INFO L444 ceAbstractionStarter]: For program point L63-32(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,632 INFO L444 ceAbstractionStarter]: For program point L63-33(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,632 INFO L444 ceAbstractionStarter]: For program point L63-34(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,633 INFO L440 ceAbstractionStarter]: At program point L64-4(lines 1 1149) the Hoare annotation is: (let ((.cse27 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse26 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= ~PagingReferenceCount~0 1)) (.cse4 (<= .cse26 0)) (.cse5 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse27) 3221225494))) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse11 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse13 (<= 1 ~compRegistered~0)) (.cse14 (<= (+ .cse27 1) 0)) (.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= 0 .cse26)) (.cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse21 (= ~setEventCalled~0 1)) (.cse22 (< 0 ~PagingReferenceCount~0))) (let ((.cse16 (= ~lowerDriverReturn~0 0)) (.cse23 (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~NP~0 5) ~MPR3~0) .cse6 .cse8 .cse9 .cse11 .cse10 .cse13 .cse14 .cse15 .cse17 .cse18 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse19 .cse21 .cse22)) (.cse24 (<= (+ ~myStatus~0 1073741637) 0)) (.cse0 (= ~myStatus~0 0)) (.cse7 (= ~NP~0 ~s~0)) (.cse12 (<= (+ ~s~0 5) ~MPR3~0)) (.cse25 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse20 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse12 .cse11 .cse13 .cse14 .cse25 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse20) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse13 .cse14 .cse25 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))))) [2019-11-19 23:38:04,633 INFO L444 ceAbstractionStarter]: For program point L63-35(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,633 INFO L444 ceAbstractionStarter]: For program point L63-36(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,633 INFO L444 ceAbstractionStarter]: For program point L63-37(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,633 INFO L440 ceAbstractionStarter]: At program point L64-7(lines 1 1149) the Hoare annotation is: (let ((.cse23 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse24 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse5 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= 0 ~pended~0)) (.cse8 (<= ~PagingReferenceCount~0 1)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= .cse24 0)) (.cse11 (<= 1 ~compRegistered~0)) (.cse12 (<= (+ .cse23 1) 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse24)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse23) 3221225494))) (.cse19 (= ~setEventCalled~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0)) (.cse22 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse21 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0))) (let ((.cse0 (and (and .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse22 .cse4 (= ~MPR3~0 ~s~0) .cse21) .cse3)) (.cse2 (<= ~MaximumInterfaceType~0 0)) (.cse1 (and .cse3 .cse4 (and .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~NP~0 ~s~0) .cse18 .cse19 .cse20) .cse21) (not .cse22)))) (or (and (<= (+ ~myStatus~0 1073741637) 0) .cse0) (and (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse1 .cse2) (and (and (= ~myStatus~0 0) .cse0) .cse2) (and .cse1 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)))))) [2019-11-19 23:38:04,634 INFO L444 ceAbstractionStarter]: For program point L63-38(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,634 INFO L444 ceAbstractionStarter]: For program point L63-39(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,634 INFO L440 ceAbstractionStarter]: At program point L64-9(lines 1007 1020) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse2 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse3 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse4 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse5 (<= ~MaximumInterfaceType~0 0)) (.cse1 (and (<= (+ ~DC~0 5) ~IPC~0) (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (let ((.cse6 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse7 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse6 0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse7 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse6) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse7) 3221225494)) (< 0 ~PagingReferenceCount~0))) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) (or (and .cse0 .cse1 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|)) (and (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) (<= (+ ~myStatus~0 1073741637) 0) .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741637) 0)) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse4 .cse5) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse1))) [2019-11-19 23:38:04,635 INFO L440 ceAbstractionStarter]: At program point L64-10(lines 1 1149) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,635 INFO L440 ceAbstractionStarter]: At program point L64-12(lines 1 1149) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= ~PagingReferenceCount~0 1)) (.cse2 (= ~SKIP2~0 ~s~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (and (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0))) (.cse5 (< 0 ~PagingReferenceCount~0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse0 .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= ~lowerDriverReturn~0 0) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5 .cse6))) [2019-11-19 23:38:04,635 INFO L440 ceAbstractionStarter]: At program point L64-13(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,635 INFO L440 ceAbstractionStarter]: At program point L64-15(lines 1 1149) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,636 INFO L440 ceAbstractionStarter]: At program point L64-17(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,636 INFO L440 ceAbstractionStarter]: At program point L64-19(lines 1 1149) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,636 INFO L440 ceAbstractionStarter]: At program point L64-21(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,637 INFO L440 ceAbstractionStarter]: At program point L64-25(lines 1 1149) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (<= ~PagingReferenceCount~0 1)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= .cse21 0)) (.cse11 (<= (+ .cse20 1) 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse21)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse6 (= 0 ~pended~0)) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= 1 ~compRegistered~0)) (.cse18 (= ~setEventCalled~0 1)) (.cse12 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse19 (< 0 ~PagingReferenceCount~0)) (.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (let ((.cse3 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~NP~0 ~s~0) .cse17 .cse18 .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse4))) (and (and .cse5 .cse7 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 (and (and .cse6 .cse13 .cse10 .cse18) .cse12) .cse19) (= ~myStatus~0 0) .cse0 .cse1 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse2 (= ~MPR3~0 ~s~0) .cse4)))) [2019-11-19 23:38:04,637 INFO L440 ceAbstractionStarter]: At program point L64-28(lines 1 1149) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,637 INFO L440 ceAbstractionStarter]: At program point L1122(lines 1121 1133) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,637 INFO L440 ceAbstractionStarter]: At program point L64-30(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,638 INFO L440 ceAbstractionStarter]: At program point L64-31(lines 1 1149) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,638 INFO L444 ceAbstractionStarter]: For program point L1056(lines 1056 1068) no Hoare annotation was computed. [2019-11-19 23:38:04,638 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 23:38:04,638 INFO L444 ceAbstractionStarter]: For program point L1056-1(lines 1056 1068) no Hoare annotation was computed. [2019-11-19 23:38:04,638 INFO L440 ceAbstractionStarter]: At program point L64-33(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,638 INFO L444 ceAbstractionStarter]: For program point L1056-2(lines 1056 1068) no Hoare annotation was computed. [2019-11-19 23:38:04,639 INFO L440 ceAbstractionStarter]: At program point L64-34(lines 1 1149) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,639 INFO L444 ceAbstractionStarter]: For program point L1056-3(lines 1056 1068) no Hoare annotation was computed. [2019-11-19 23:38:04,639 INFO L444 ceAbstractionStarter]: For program point L924(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,639 INFO L440 ceAbstractionStarter]: At program point L64-36(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,639 INFO L444 ceAbstractionStarter]: For program point L924-2(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,640 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,640 INFO L444 ceAbstractionStarter]: For program point L924-4(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,640 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 796) no Hoare annotation was computed. [2019-11-19 23:38:04,640 INFO L444 ceAbstractionStarter]: For program point L924-6(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,640 INFO L444 ceAbstractionStarter]: For program point L924-8(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,640 INFO L444 ceAbstractionStarter]: For program point L924-10(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,640 INFO L444 ceAbstractionStarter]: For program point L924-12(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,641 INFO L444 ceAbstractionStarter]: For program point L924-14(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,641 INFO L444 ceAbstractionStarter]: For program point L924-16(lines 924 930) no Hoare annotation was computed. [2019-11-19 23:38:04,641 INFO L440 ceAbstractionStarter]: At program point L1057(lines 1056 1068) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (and (let ((.cse5 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse6 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse5 0) (<= 1 ~compRegistered~0) (<= (+ .cse6 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse5) (= ~NP~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse6) 3221225494)) (< 0 ~PagingReferenceCount~0))) (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= ~MaximumInterfaceType~0 0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~myStatus~0 1073741637) 0) .cse4))) [2019-11-19 23:38:04,642 INFO L440 ceAbstractionStarter]: At program point L1057-1(lines 1056 1068) the Hoare annotation is: (let ((.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) (and (= ULTIMATE.start_main_~status~1 0) (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))))) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (and (= ~myStatus~0 0) .cse0) (<= ~MaximumInterfaceType~0 0)))) [2019-11-19 23:38:04,642 INFO L440 ceAbstractionStarter]: At program point L1057-2(lines 1056 1068) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,642 INFO L440 ceAbstractionStarter]: At program point L1057-3(lines 1056 1068) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (<= 1 ~compRegistered~0) (= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,642 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 594) no Hoare annotation was computed. [2019-11-19 23:38:04,642 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 529 594) no Hoare annotation was computed. [2019-11-19 23:38:04,643 INFO L444 ceAbstractionStarter]: For program point L199(lines 199 207) no Hoare annotation was computed. [2019-11-19 23:38:04,643 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 135) no Hoare annotation was computed. [2019-11-19 23:38:04,643 INFO L440 ceAbstractionStarter]: At program point L1124(lines 1123 1133) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,643 INFO L444 ceAbstractionStarter]: For program point L133-2(lines 133 135) no Hoare annotation was computed. [2019-11-19 23:38:04,643 INFO L444 ceAbstractionStarter]: For program point L398-1(lines 398 402) no Hoare annotation was computed. [2019-11-19 23:38:04,644 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-19 23:38:04,644 INFO L444 ceAbstractionStarter]: For program point L266-2(lines 266 268) no Hoare annotation was computed. [2019-11-19 23:38:04,644 INFO L440 ceAbstractionStarter]: At program point L1059(lines 1058 1068) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (and (let ((.cse5 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse6 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse5 0) (<= 1 ~compRegistered~0) (<= (+ .cse6 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse5) (= ~NP~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse6) 3221225494)) (< 0 ~PagingReferenceCount~0))) (< 258 ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0) (<= ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0 259)) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= ~MaximumInterfaceType~0 0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~myStatus~0 1073741637) 0) .cse4))) [2019-11-19 23:38:04,644 INFO L440 ceAbstractionStarter]: At program point L1059-1(lines 1058 1068) the Hoare annotation is: (let ((.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) (and (= ULTIMATE.start_main_~status~1 0) (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))))) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)))))) (or (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) (and (and (= ~myStatus~0 0) .cse0) (<= ~MaximumInterfaceType~0 0)))) [2019-11-19 23:38:04,645 INFO L440 ceAbstractionStarter]: At program point L1059-2(lines 1058 1068) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,645 INFO L440 ceAbstractionStarter]: At program point L1059-3(lines 1058 1068) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~myStatus~0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (<= 1 ~compRegistered~0) (= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,645 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 571) no Hoare annotation was computed. [2019-11-19 23:38:04,645 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,646 INFO L444 ceAbstractionStarter]: For program point L994-2(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,646 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 874) no Hoare annotation was computed. [2019-11-19 23:38:04,646 INFO L444 ceAbstractionStarter]: For program point L994-4(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,646 INFO L444 ceAbstractionStarter]: For program point L994-6(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,646 INFO L444 ceAbstractionStarter]: For program point L994-8(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,646 INFO L444 ceAbstractionStarter]: For program point L994-10(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,646 INFO L444 ceAbstractionStarter]: For program point L994-12(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,647 INFO L444 ceAbstractionStarter]: For program point L532(lines 532 542) no Hoare annotation was computed. [2019-11-19 23:38:04,647 INFO L444 ceAbstractionStarter]: For program point L994-14(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,647 INFO L444 ceAbstractionStarter]: For program point L994-16(lines 994 1001) no Hoare annotation was computed. [2019-11-19 23:38:04,647 INFO L440 ceAbstractionStarter]: At program point L863(lines 862 874) the Hoare annotation is: false [2019-11-19 23:38:04,647 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 746) no Hoare annotation was computed. [2019-11-19 23:38:04,647 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,648 INFO L440 ceAbstractionStarter]: At program point L665(lines 725 727) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= ~PagingReferenceCount~0 0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 0 ~PagingReferenceCount~0)) (.cse12 (= ~NP~0 ~s~0)) (.cse13 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ~myStatus~0 1073741637) 0) .cse13) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-19 23:38:04,648 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,648 INFO L440 ceAbstractionStarter]: At program point L732(lines 731 746) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= ~PagingReferenceCount~0 0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 0 ~PagingReferenceCount~0)) (.cse12 (= ~NP~0 ~s~0)) (.cse13 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ~myStatus~0 1073741637) 0) .cse13) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-19 23:38:04,649 INFO L440 ceAbstractionStarter]: At program point L600(lines 435 602) the Hoare annotation is: (let ((.cse3 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse4 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse5 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse6 (<= ~MaximumInterfaceType~0 0)) (.cse0 (= 0 |ULTIMATE.start_FloppyStartDevice_#res|)) (.cse1 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse2 (and (<= (+ ~DC~0 5) ~IPC~0) (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (let ((.cse7 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse8 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse7 0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse8 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse7) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse8) 3221225494)) (< 0 ~PagingReferenceCount~0))) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5 .cse6) (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|)) (and (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741637) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) (<= (+ ~myStatus~0 1073741637) 0) .cse2 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741637) 0)) (and (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0) .cse2))) [2019-11-19 23:38:04,649 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,649 INFO L440 ceAbstractionStarter]: At program point L865(lines 864 874) the Hoare annotation is: false [2019-11-19 23:38:04,649 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,649 INFO L440 ceAbstractionStarter]: At program point L734(lines 733 746) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-11-19 23:38:04,650 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 539) no Hoare annotation was computed. [2019-11-19 23:38:04,650 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 278) no Hoare annotation was computed. [2019-11-19 23:38:04,650 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,650 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,650 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 427) no Hoare annotation was computed. [2019-11-19 23:38:04,650 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,650 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2019-11-19 23:38:04,651 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 341 346) no Hoare annotation was computed. [2019-11-19 23:38:04,651 INFO L440 ceAbstractionStarter]: At program point L209(lines 208 427) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= ~PagingReferenceCount~0 1)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (= ~NP~0 ~s~0)) (.cse13 (<= ~MaximumInterfaceType~0 0)) (.cse14 (< 0 ~PagingReferenceCount~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ~myStatus~0 1073741637) 0) .cse13 .cse14))) [2019-11-19 23:38:04,651 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,651 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,651 INFO L440 ceAbstractionStarter]: At program point L805(lines 668 807) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-11-19 23:38:04,652 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 426) no Hoare annotation was computed. [2019-11-19 23:38:04,652 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 147) no Hoare annotation was computed. [2019-11-19 23:38:04,652 INFO L440 ceAbstractionStarter]: At program point L1004(lines 934 1006) the Hoare annotation is: (let ((.cse30 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse29 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse14 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse25 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse26 (= ~MPR3~0 ~s~0)) (.cse27 (= 259 |ULTIMATE.start_IofCallDriver_#res|)) (.cse24 (= ~myStatus~0 0)) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~PagingReferenceCount~0 1)) (.cse3 (<= .cse29 0)) (.cse4 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse5 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse6 (= ~NP~0 ~s~0)) (.cse7 (<= (+ ~myStatus~0 1073741637) 0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse30) 3221225494))) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= (+ ~s~0 5) ~MPR3~0)) (.cse13 (<= 1 ~compRegistered~0)) (.cse15 (<= (+ .cse30 1) 0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse28 (= ~lowerDriverReturn~0 0)) (.cse17 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= 0 .cse29)) (.cse19 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse20 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse21 (<= ~MaximumInterfaceType~0 0)) (.cse22 (= ~setEventCalled~0 1)) (.cse23 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse26 .cse19 .cse27 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse26 .cse19 .cse27 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2019-11-19 23:38:04,653 INFO L440 ceAbstractionStarter]: At program point L1004-1(lines 934 1006) the Hoare annotation is: (let ((.cse24 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (= 0 ~pended~0)) (.cse8 (<= ~PagingReferenceCount~0 1)) (.cse10 (<= .cse23 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse24) 3221225494))) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse11 (<= 1 ~compRegistered~0)) (.cse12 (<= (+ .cse24 1) 0)) (.cse5 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse17 (<= 0 .cse23)) (.cse21 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse22 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse19 (= ~setEventCalled~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0))) (let ((.cse2 (<= ~MaximumInterfaceType~0 0)) (.cse1 (and .cse7 .cse8 .cse10 .cse13 .cse14 .cse16 .cse18 .cse6 .cse9 .cse4 .cse11 .cse12 .cse5 .cse15 .cse17 (= ~MPR3~0 ~s~0) .cse21 (= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse22 .cse19 .cse20)) (.cse3 (and .cse0 .cse4 (and .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~NP~0 ~s~0) .cse18 .cse19 .cse20) .cse21 .cse22) (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2) (and (and .cse3 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse2) (and .cse0 .cse1 (<= (+ ~myStatus~0 1073741637) 0)) (and .cse3 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)))))) [2019-11-19 23:38:04,653 INFO L440 ceAbstractionStarter]: At program point L1004-2(lines 934 1006) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse5 (and (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0))) (.cse1 (<= ~PagingReferenceCount~0 1)) (.cse2 (= ~SKIP2~0 ~s~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (< 0 ~PagingReferenceCount~0)) (.cse4 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse0 .cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse2 .cse3 .cse4 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) .cse5 (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) .cse6) (and .cse0 (= ~lowerDriverReturn~0 0) .cse5 .cse1 .cse2 .cse3 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 .cse4))) [2019-11-19 23:38:04,653 INFO L440 ceAbstractionStarter]: At program point L1004-3(lines 934 1006) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,654 INFO L440 ceAbstractionStarter]: At program point L1004-4(lines 934 1006) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,654 INFO L440 ceAbstractionStarter]: At program point L1004-5(lines 934 1006) the Hoare annotation is: (let ((.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (= 0 ~pended~0)) (.cse7 (<= ~PagingReferenceCount~0 1)) (.cse9 (<= .cse20 0)) (.cse12 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (<= 1 ~compRegistered~0)) (.cse11 (<= (+ .cse21 1) 0)) (.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 .cse20)) (.cse4 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse18 (= ~setEventCalled~0 1)) (.cse19 (< 0 ~PagingReferenceCount~0))) (or (let ((.cse3 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) .cse13 (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) .cse14 .cse15 .cse16 (= ~NP~0 ~s~0) .cse17 .cse18 .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse4))) (and (= ~myStatus~0 0) .cse1 .cse6 .cse7 .cse9 .cse12 .cse13 .cse15 .cse17 .cse5 .cse8 .cse2 .cse10 .cse11 .cse0 .cse14 .cse16 (= ~MPR3~0 ~s~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse4 .cse18 .cse19)))) [2019-11-19 23:38:04,654 INFO L440 ceAbstractionStarter]: At program point L1004-6(lines 934 1006) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,654 INFO L440 ceAbstractionStarter]: At program point L1004-7(lines 934 1006) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,655 INFO L440 ceAbstractionStarter]: At program point L1004-8(lines 934 1006) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,655 INFO L440 ceAbstractionStarter]: At program point L1071(lines 1071 1092) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,655 INFO L440 ceAbstractionStarter]: At program point L808(lines 808 832) the Hoare annotation is: (let ((.cse1 (<= ~MaximumInterfaceType~0 0)) (.cse0 (and (<= (+ ~DC~0 5) ~IPC~0) (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (let ((.cse2 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse2) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse2 0) (<= (+ .cse3 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse3) 3221225494)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)) (= ULTIMATE.start_main_~status~1 0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) (or (and (and (= ~myStatus~0 0) .cse0) .cse1) (and (and .cse0 (<= (+ ~myStatus~0 1073741637) 0)) .cse1) (and .cse0 (= |ULTIMATE.start_IoBuildDeviceIoControlRequest_#res| 0)))) [2019-11-19 23:38:04,656 INFO L440 ceAbstractionStarter]: At program point L610(lines 603 612) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (<= ~PagingReferenceCount~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= .cse18 0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 .cse18)) (.cse14 (= ~NP~0 ~s~0)) (.cse15 (<= ~MaximumInterfaceType~0 0)) (.cse16 (= ~setEventCalled~0 1)) (.cse17 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~myStatus~0 1073741637) 0) .cse15 .cse16 .cse17) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-19 23:38:04,656 INFO L440 ceAbstractionStarter]: At program point L610-1(lines 603 612) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= ULTIMATE.start_main_~status~1 0) (let ((.cse2 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse2 0) (<= 1 ~compRegistered~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 .cse2) (= ~NP~0 ~s~0) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))))) (.cse1 (<= ~MaximumInterfaceType~0 0))) (or (and (and (= ~myStatus~0 0) .cse0) .cse1) (and .cse0 (<= (+ ~myStatus~0 1073741637) 0) .cse1))) [2019-11-19 23:38:04,656 INFO L440 ceAbstractionStarter]: At program point L544(lines 531 571) the Hoare annotation is: (and (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (let ((.cse0 (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse1 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse2) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))))) (<= (+ ~DC~0 5) ~IPC~0)))) (or (and (= ~myStatus~0 0) .cse0) (and (not (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse0 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)))) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) (<= ~MaximumInterfaceType~0 0)) [2019-11-19 23:38:04,657 INFO L440 ceAbstractionStarter]: At program point L610-2(lines 603 612) the Hoare annotation is: false [2019-11-19 23:38:04,657 INFO L440 ceAbstractionStarter]: At program point L610-3(lines 603 612) the Hoare annotation is: false [2019-11-19 23:38:04,657 INFO L440 ceAbstractionStarter]: At program point L610-4(lines 603 612) the Hoare annotation is: false [2019-11-19 23:38:04,657 INFO L440 ceAbstractionStarter]: At program point L610-5(lines 603 612) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~myStatus~0 0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 .cse0) (= ~NP~0 ~s~0) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,657 INFO L440 ceAbstractionStarter]: At program point L610-6(lines 603 612) the Hoare annotation is: false [2019-11-19 23:38:04,658 INFO L440 ceAbstractionStarter]: At program point L610-7(lines 603 612) the Hoare annotation is: false [2019-11-19 23:38:04,658 INFO L440 ceAbstractionStarter]: At program point L610-8(lines 603 612) the Hoare annotation is: false [2019-11-19 23:38:04,658 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 425) no Hoare annotation was computed. [2019-11-19 23:38:04,658 INFO L444 ceAbstractionStarter]: For program point L545-1(lines 545 548) no Hoare annotation was computed. [2019-11-19 23:38:04,658 INFO L440 ceAbstractionStarter]: At program point L215(lines 211 426) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,658 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,659 INFO L440 ceAbstractionStarter]: At program point L942-1(lines 942 954) the Hoare annotation is: (let ((.cse22 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse2 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse5 (<= ~PagingReferenceCount~0 1)) (.cse7 (<= .cse21 0)) (.cse11 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= (+ .cse22 1) 0)) (.cse12 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 .cse21)) (.cse18 (<= ~MaximumInterfaceType~0 0)) (.cse19 (= ~setEventCalled~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse13 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse17 .cse1 .cse6 .cse8 .cse9 .cse10 .cse12 .cse14 .cse16 .cse18 .cse19 .cse20)))) [2019-11-19 23:38:04,659 INFO L444 ceAbstractionStarter]: For program point L942-2(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,659 INFO L440 ceAbstractionStarter]: At program point L942-3(lines 942 954) the Hoare annotation is: (let ((.cse1 (<= ~MaximumInterfaceType~0 0)) (.cse0 (let ((.cse2 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse2 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse3 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse2) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse3) 3221225494)) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))))) (or (and (and (= ~myStatus~0 0) .cse0) .cse1) (and .cse1 (and .cse0 (<= (+ ~myStatus~0 1073741637) 0))))) [2019-11-19 23:38:04,660 INFO L444 ceAbstractionStarter]: For program point L942-4(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,660 INFO L440 ceAbstractionStarter]: At program point L942-5(lines 942 954) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,660 INFO L444 ceAbstractionStarter]: For program point L942-6(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,660 INFO L440 ceAbstractionStarter]: At program point L942-7(lines 942 954) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,660 INFO L444 ceAbstractionStarter]: For program point L942-8(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,661 INFO L440 ceAbstractionStarter]: At program point L942-9(lines 942 954) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,661 INFO L444 ceAbstractionStarter]: For program point L942-10(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,661 INFO L440 ceAbstractionStarter]: At program point L942-11(lines 942 954) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~myStatus~0 0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,661 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,661 INFO L444 ceAbstractionStarter]: For program point L942-12(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,662 INFO L440 ceAbstractionStarter]: At program point L942-13(lines 942 954) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,662 INFO L444 ceAbstractionStarter]: For program point L942-14(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,662 INFO L440 ceAbstractionStarter]: At program point L942-15(lines 942 954) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,662 INFO L444 ceAbstractionStarter]: For program point L942-16(lines 942 954) no Hoare annotation was computed. [2019-11-19 23:38:04,662 INFO L440 ceAbstractionStarter]: At program point L942-17(lines 942 954) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,663 INFO L440 ceAbstractionStarter]: At program point L877(lines 877 898) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (<= (+ ~DC~0 5) ~IPC~0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse8 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse9 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse8) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse8 0) (<= (+ .cse9 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))))))) (.cse2 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse5 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse6 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse7 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse3) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 .cse7))) [2019-11-19 23:38:04,663 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,663 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,663 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 424) no Hoare annotation was computed. [2019-11-19 23:38:04,664 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:38:04,664 INFO L440 ceAbstractionStarter]: At program point L86(lines 708 747) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~myStatus~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= ~PagingReferenceCount~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= 0 ~PagingReferenceCount~0) (<= ~MaximumInterfaceType~0 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) [2019-11-19 23:38:04,664 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1017) no Hoare annotation was computed. [2019-11-19 23:38:04,664 INFO L444 ceAbstractionStarter]: For program point L1011-2(lines 1011 1017) no Hoare annotation was computed. [2019-11-19 23:38:04,664 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,664 INFO L444 ceAbstractionStarter]: For program point L1011-4(lines 1011 1017) no Hoare annotation was computed. [2019-11-19 23:38:04,665 INFO L444 ceAbstractionStarter]: For program point L1011-6(lines 1011 1017) no Hoare annotation was computed. [2019-11-19 23:38:04,665 INFO L444 ceAbstractionStarter]: For program point L1078(lines 1078 1090) no Hoare annotation was computed. [2019-11-19 23:38:04,665 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,665 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 423) no Hoare annotation was computed. [2019-11-19 23:38:04,665 INFO L440 ceAbstractionStarter]: At program point L1079(lines 1078 1090) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,665 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,666 INFO L444 ceAbstractionStarter]: For program point L749(lines 749 753) no Hoare annotation was computed. [2019-11-19 23:38:04,666 INFO L440 ceAbstractionStarter]: At program point L551-2(lines 551 567) the Hoare annotation is: (and (let ((.cse0 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse1 (and (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse2 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse2) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse2 0) (<= (+ .cse3 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse3) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))))) (<= (+ ~DC~0 5) ~IPC~0)))) (or (and (= ~myStatus~0 0) .cse0 .cse1) (and (not (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse0 .cse1 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)))) (= ULTIMATE.start_main_~status~1 0) (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) (<= ~MaximumInterfaceType~0 0)) [2019-11-19 23:38:04,667 INFO L440 ceAbstractionStarter]: At program point L419(lines 230 420) the Hoare annotation is: (let ((.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (= ~s~0 ~DC~0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse11 (<= (+ ~DC~0 5) ~IPC~0)) (.cse12 (and (and .cse4 (let ((.cse14 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse15 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse2 (<= ~PagingReferenceCount~0 1) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse14) (and (and .cse3 (= 0 ~pended~0) .cse5 .cse13) .cse7) .cse6 (<= .cse14 0) (<= (+ .cse15 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (< 0 ~PagingReferenceCount~0)))) .cse8 .cse9))) (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and .cse11 .cse12)) (.cse10 (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823))) (or (and (= 0 |ULTIMATE.start_FloppyStartDevice_#res|) .cse0 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse1) (and (and .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7) .cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse9) (and (<= .cse10 0) .cse11 .cse12 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (and (= ~myStatus~0 0) .cse0 .cse1) (and .cse12 .cse0 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (and (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741637) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741637) 0) .cse1 (<= (+ ~myStatus~0 1073741637) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741637) 0)) (and (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse11 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0) .cse12) (and .cse3 .cse13 .cse5 (= .cse10 0)))))) [2019-11-19 23:38:04,667 INFO L440 ceAbstractionStarter]: At program point L221(lines 217 424) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,667 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,667 INFO L444 ceAbstractionStarter]: For program point L948-2(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,667 INFO L444 ceAbstractionStarter]: For program point L948-4(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,668 INFO L444 ceAbstractionStarter]: For program point L948-6(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,668 INFO L444 ceAbstractionStarter]: For program point L948-8(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,668 INFO L444 ceAbstractionStarter]: For program point L948-10(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,668 INFO L444 ceAbstractionStarter]: For program point L552(lines 551 567) no Hoare annotation was computed. [2019-11-19 23:38:04,668 INFO L444 ceAbstractionStarter]: For program point L948-12(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,668 INFO L444 ceAbstractionStarter]: For program point L948-14(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,668 INFO L444 ceAbstractionStarter]: For program point L948-16(lines 948 952) no Hoare annotation was computed. [2019-11-19 23:38:04,669 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,669 INFO L440 ceAbstractionStarter]: At program point L1081(lines 1080 1090) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,669 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,669 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 422) no Hoare annotation was computed. [2019-11-19 23:38:04,669 INFO L444 ceAbstractionStarter]: For program point L884(lines 884 896) no Hoare annotation was computed. [2019-11-19 23:38:04,669 INFO L444 ceAbstractionStarter]: For program point L818(lines 818 830) no Hoare annotation was computed. [2019-11-19 23:38:04,670 INFO L440 ceAbstractionStarter]: At program point L224(lines 223 422) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,670 INFO L440 ceAbstractionStarter]: At program point L158(lines 98 160) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-19 23:38:04,670 INFO L440 ceAbstractionStarter]: At program point L885(lines 884 896) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (<= (+ ~DC~0 5) ~IPC~0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse8 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse9 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse8) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse8 0) (<= (+ .cse9 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))))))) (.cse2 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse5 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse6 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse7 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse3) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 .cse7))) [2019-11-19 23:38:04,671 INFO L440 ceAbstractionStarter]: At program point L819(lines 818 830) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ULTIMATE.start_main_~status~1 0) (and (<= (+ ~DC~0 5) ~IPC~0) (and (and (let ((.cse2 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse2) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse2 0) (<= (+ .cse3 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse3) 3221225494)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (<= (+ ~DC~0 2) ~SKIP2~0)) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) (.cse1 (<= ~MaximumInterfaceType~0 0))) (or (and (and (= ~myStatus~0 0) .cse0) .cse1) (and (and (<= (+ ~myStatus~0 1073741637) 0) .cse0) .cse1))) [2019-11-19 23:38:04,671 INFO L444 ceAbstractionStarter]: For program point L226(lines 226 421) no Hoare annotation was computed. [2019-11-19 23:38:04,671 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:38:04,672 INFO L440 ceAbstractionStarter]: At program point L887(lines 886 896) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse1 (and (<= (+ ~DC~0 5) ~IPC~0) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (let ((.cse8 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse9 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~PagingReferenceCount~0 1) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0)) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse8) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse8 0) (<= (+ .cse9 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (< 0 ~PagingReferenceCount~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))))))) (.cse2 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 0 ULTIMATE.start_FloppyStartDevice_~InterfaceType~0)) (.cse5 (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) (.cse6 (= |ULTIMATE.start_FlFdcDeviceIo_#res| 0)) (.cse7 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse3) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6 .cse7))) [2019-11-19 23:38:04,672 INFO L440 ceAbstractionStarter]: At program point L821(lines 820 830) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (<= (+ ~s~0 5) ~MPR3~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,673 INFO L440 ceAbstractionStarter]: At program point L755(lines 748 803) the Hoare annotation is: (let ((.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse12 (= 0 ~pended~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (= ~s~0 ~DC~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (let ((.cse14 (and (and .cse2 (let ((.cse16 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse0 (and .cse12 .cse1 .cse13) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse16) .cse4 (<= 0 ~PagingReferenceCount~0) (<= .cse16 0) (<= (+ .cse17 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)) (<= ~PagingReferenceCount~0 0) .cse5))) .cse6 .cse7))) (let ((.cse3 (= ~SKIP2~0 ~s~0)) (.cse15 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (= 0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse11 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (and .cse14 (<= (+ ~DC~0 5) ~IPC~0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse6 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse7) (and (= 0 |ULTIMATE.start_FloppyStartDevice_#res|) .cse8 .cse9 (= 0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse10 (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) .cse11) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (and .cse0 .cse12 .cse1 .cse4 .cse5) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse3 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse1 (= 0 (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823)) (= 0 (+ ULTIMATE.start_main_~status~1 1073741823)) .cse13 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0)) (and .cse9 .cse10 .cse14 .cse11 .cse15) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse12 .cse1 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse13) (and .cse0 .cse12 .cse3 .cse4 .cse11 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (<= 0 |ULTIMATE.start_FloppyPnp_#res|) .cse15 .cse5 (= ~lowerDriverReturn~0 0) .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (and (<= (+ ULTIMATE.start_main_~status~1 1073741637) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741637) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741637) 0) (<= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741637) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741637) 0) .cse8 (<= (+ ~myStatus~0 1073741637) 0) (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741637) 0)) (and (= ~myStatus~0 0) .cse9 .cse10 .cse11 .cse8) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741670) 0) .cse8 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) (<= (+ |ULTIMATE.start_FloppyStartDevice_#res| 1073741670) 0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) (<= (+ ULTIMATE.start_main_~status~1 1073741670) 0)))))) [2019-11-19 23:38:04,673 INFO L440 ceAbstractionStarter]: At program point L227(lines 226 421) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,673 INFO L440 ceAbstractionStarter]: At program point L95(lines 91 97) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 |ULTIMATE.start_FlAcpiConfigureFloppy_#res|) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= |ULTIMATE.start_IofCallDriver_#res| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_IofCallDriver_#res|) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (= ~NP~0 ~s~0) (< 0 (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,673 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,674 INFO L444 ceAbstractionStarter]: For program point L492(lines 492 504) no Hoare annotation was computed. [2019-11-19 23:38:04,674 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 761) no Hoare annotation was computed. [2019-11-19 23:38:04,674 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 367) no Hoare annotation was computed. [2019-11-19 23:38:04,674 INFO L440 ceAbstractionStarter]: At program point L229(lines 228 421) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,674 INFO L444 ceAbstractionStarter]: For program point L296-1(lines 230 418) no Hoare annotation was computed. [2019-11-19 23:38:04,675 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,675 INFO L444 ceAbstractionStarter]: For program point L957(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,675 INFO L444 ceAbstractionStarter]: For program point L957-1(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,675 INFO L444 ceAbstractionStarter]: For program point L957-2(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,675 INFO L444 ceAbstractionStarter]: For program point L957-3(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,675 INFO L444 ceAbstractionStarter]: For program point L957-4(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,675 INFO L444 ceAbstractionStarter]: For program point L957-5(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,676 INFO L444 ceAbstractionStarter]: For program point L957-6(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,676 INFO L444 ceAbstractionStarter]: For program point L957-7(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,676 INFO L444 ceAbstractionStarter]: For program point L957-8(lines 957 980) no Hoare annotation was computed. [2019-11-19 23:38:04,676 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 431) no Hoare annotation was computed. [2019-11-19 23:38:04,676 INFO L444 ceAbstractionStarter]: For program point L429-2(lines 429 431) no Hoare annotation was computed. [2019-11-19 23:38:04,677 INFO L440 ceAbstractionStarter]: At program point L958(lines 957 980) the Hoare annotation is: (let ((.cse22 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse2 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse5 (<= ~PagingReferenceCount~0 1)) (.cse7 (<= .cse21 0)) (.cse11 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= (+ .cse22 1) 0)) (.cse12 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 .cse21)) (.cse18 (<= ~MaximumInterfaceType~0 0)) (.cse19 (= ~setEventCalled~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 (= ~myStatus~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse13 .cse15 (<= (+ ~myStatus~0 1073741637) 0) .cse17 .cse1 .cse6 .cse8 .cse9 .cse10 .cse12 .cse14 .cse16 .cse18 .cse19 .cse20)))) [2019-11-19 23:38:04,677 INFO L440 ceAbstractionStarter]: At program point L958-1(lines 957 980) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= ~PagingReferenceCount~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (<= 1 ~compRegistered~0) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (<= ~MaximumInterfaceType~0 0) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,677 INFO L440 ceAbstractionStarter]: At program point L958-2(lines 957 980) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,677 INFO L440 ceAbstractionStarter]: At program point L958-3(lines 957 980) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,678 INFO L440 ceAbstractionStarter]: At program point L958-4(lines 957 980) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0) (< 0 ~PagingReferenceCount~0)) [2019-11-19 23:38:04,678 INFO L440 ceAbstractionStarter]: At program point L958-5(lines 957 980) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_FloppyPnpComplete_#res| 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse0 0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ .cse1 1) 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0))) [2019-11-19 23:38:04,678 INFO L440 ceAbstractionStarter]: At program point L958-6(lines 957 980) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,679 INFO L440 ceAbstractionStarter]: At program point L958-7(lines 957 980) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,679 INFO L440 ceAbstractionStarter]: At program point L958-8(lines 957 980) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0)) [2019-11-19 23:38:04,679 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 630) no Hoare annotation was computed. [2019-11-19 23:38:04,679 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,679 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 565) no Hoare annotation was computed. [2019-11-19 23:38:04,679 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 503) no Hoare annotation was computed. [2019-11-19 23:38:04,680 INFO L440 ceAbstractionStarter]: At program point L497-1(lines 1 1149) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (<= ~PagingReferenceCount~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (= ~NP~0 ~s~0)) (.cse13 (<= ~MaximumInterfaceType~0 0)) (.cse14 (< 0 ~PagingReferenceCount~0))) (or (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ~myStatus~0 1073741637) 0) .cse13 .cse14))) [2019-11-19 23:38:04,680 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-19 23:38:04,680 INFO L440 ceAbstractionStarter]: At program point L1026(lines 1021 1028) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (<= ~PagingReferenceCount~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (= ~NP~0 ~s~0)) (.cse13 (<= ~MaximumInterfaceType~0 0)) (.cse14 (= ~setEventCalled~0 1)) (.cse15 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ~myStatus~0 1073741637) 0) .cse13 .cse14 .cse15) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-19 23:38:04,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:38:04 BoogieIcfgContainer [2019-11-19 23:38:04,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:38:04,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:38:04,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:38:04,889 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:38:04,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:36:50" (3/4) ... [2019-11-19 23:38:04,893 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:38:04,933 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 92 nodes and edges [2019-11-19 23:38:04,937 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2019-11-19 23:38:04,940 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-19 23:38:04,942 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:38:04,993 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && (NP + 5 <= MPR3 && 0 == pended) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == \result) && 0 <= \result) && 0 == returnVal2) || (((((lowerDriverReturn == status && lowerDriverReturn == \result) && ((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2)) || ((((((0 == \result && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && 0 == \result) && (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 5 <= IPC) && status == 0)) || ((((NP + 5 <= MPR3 && 0 == \result + 1073741823) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 5 <= IPC) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 5 <= IPC) && status == 0)) || ((((((((status + 1073741637 <= 0 && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 5 <= IPC) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || (((((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && ((NP + 2 <= SKIP1 && (NP + 5 <= MPR3 && 0 == pended) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((ntStatus == 0 && 0 == \result) && status == 0) && ((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) [2019-11-19 23:38:04,993 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == status) && lowerDriverReturn == \result) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((0 == \result && (((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && 0 == \result) && status == 0)) || ((((((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && (((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((NP + 5 <= MPR3 && 0 == \result + 1073741823) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0)) || ((((ntStatus == 0 && 0 == \result) && ((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && status == 0) && 0 == returnVal2)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == \result) && 0 <= \result) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == 0) && NP + 5 <= MPR3) && \result <= 0)) || ((((((((status + 1073741637 <= 0 && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && (((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && status == 0) && (((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC)) || ((((((\result + 1073741670 <= 0 && (((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0) [2019-11-19 23:38:04,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && ntStatus == 0) && 0 == \result) && status == 0) && 0 == returnVal2) || ((((((((status + 1073741637 <= 0 && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && DC + 5 <= IPC && (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && NP + 5 <= MPR3) && \result <= 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == \result) && 0 <= \result) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && (((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && DC + 5 <= IPC && (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && status == 0)) || ((((((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && DC + 5 <= IPC && (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((((0 == \result && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && 0 == \result) && status == 0) && DC + 5 <= IPC && (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) [2019-11-19 23:38:04,995 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\result + s + 1073741642 <= IPC && s + ntStatus + 1073741642 <= IPC) && \result + s + 1073741642 <= IPC) && status + 1073741642 <= 0) && ntStatus + DC + 1073741642 <= IPC) && ntStatus + DC + 1073741642 <= IPC) && \result + DC + 1073741642 <= IPC) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && myStatus + DC + 1073741642 <= IPC) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && NP + 5 <= MPR3) && \result <= 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == \result) && 0 <= \result) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((0 == \result && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && 0 == \result) && status == 0) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC)) || ((((((((status + 1073741637 <= 0 && ntStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && ntStatus + 1073741637 <= 0)) || (SKIP2 == s && (((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2)) || ((((((status + 1073741675 <= 0 && s + ntStatus + 1073741675 <= IPC) && \result + s + 1073741675 <= IPC) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && \result + s + 1073741675 <= IPC) && s + ntStatus + 1073741675 <= IPC) && \result + DC + 1073741675 <= IPC)) || ((((((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && \result + s + 1073741828 <= IPC) && returnVal2 + DC + 1073741828 <= IPC) && status + 1073741828 <= 0) && ntStatus + DC + 1073741828 <= IPC)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && status == 0) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC)) || ((((((\result + 1073741670 <= 0 && \result + 1073741670 <= 0) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((ntStatus == 0 && 0 == \result) && status == 0) && (((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && 0 == returnVal2) [2019-11-19 23:38:05,002 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\result + 1073741670 <= 0 && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) || (((myStatus == 0 && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus == 0) && 0 == \result)) || (((ntStatus == 0 && 0 == \result) && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 == returnVal2)) || (((0 == \result && ntStatus == 0) && 0 == \result) && (0 == ntStatus && 0 == \result) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((ntStatus + 1073741637 <= 0 && \result + 1073741637 <= 0) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status == 0) && s == DC)) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && 0 == \result) && 0 <= \result) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == 0) && NP + 5 <= MPR3) && \result <= 0)) || ((((NP + 5 <= MPR3 && 0 == \result + 1073741823) && s == DC) && status == 0) && ntStatus + 1073741823 == 0)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn)) || ((((lowerDriverReturn == \result && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) [2019-11-19 23:38:05,006 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount [2019-11-19 23:38:05,007 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount [2019-11-19 23:38:05,007 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && ((NP + 5 <= MPR3 && 0 == pended) && 0 == compRegistered) && status == 0) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount) || (((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && ((NP + 5 <= MPR3 && 0 == pended) && 0 == compRegistered) && status == 0) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == \result) && 0 == returnVal2) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) [2019-11-19 23:38:05,007 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s == MPR1 && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((ntStatus == 0 && DC + 5 <= IPC) && (((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount))) [2019-11-19 23:38:05,008 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && 0 == returnVal2) && lowerDriverReturn == returnVal2) || (((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && returnVal2 + 1073741823 <= 0) && lowerDriverReturn == returnVal2)) || (((((((((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (((0 == pended && NP + 5 <= MPR3) && 1 <= compRegistered) && setEventCalled == 1) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && myStatus == 0) && ntStatus == 0) && DC + 5 <= IPC) && 259 == returnVal2) && status == 0) && MPR3 == s) && lowerDriverReturn == returnVal2) [2019-11-19 23:38:05,008 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,008 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,008 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && 0 == returnVal2) && lowerDriverReturn == returnVal2) || (((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && returnVal2 + 1073741823 <= 0) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,008 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount [2019-11-19 23:38:05,009 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount [2019-11-19 23:38:05,009 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,009 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == \result && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2)) || (((ntStatus + 1073741823 <= 0 && DC + 5 <= IPC) && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && returnVal2 + 1073741823 <= 0)) || ((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus == 0) && 0 == returnVal2)) || ((((((ntStatus + 1073741637 <= 0 && \result + 1073741637 <= 0) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || (((((\result + 1073741670 <= 0 && DC + 5 <= IPC) && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((NP + 5 <= MPR3 && s == DC) && status == 0) && ntStatus + 1073741823 == 0) [2019-11-19 23:38:05,010 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,010 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((NP + 2 <= SKIP1 && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount [2019-11-19 23:38:05,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp30 == 259) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp30 == 259) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp30 == 259) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,012 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,012 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,012 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp30 == 259) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,012 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,012 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,013 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,013 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,014 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1 [2019-11-19 23:38:05,014 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s == MPR1 && myStatus == 0) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s == MPR1 && myStatus == 0) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((s == MPR1 && myStatus == 0) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0)) || ((myStatus == 0 && (((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && returnVal2 + 1073741823 <= 0) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus == 0) && returnVal2 + 1073741823 <= 0) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((myStatus == 0 && (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || ((((((((((((((((((((((0 == pended && DC + 5 <= IPC) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || ((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || (((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || (((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s == MPR1 && myStatus == 0) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s == MPR1 && myStatus == 0) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) [2019-11-19 23:38:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((myStatus == 0 && (((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && __cil_tmp42 <= 259) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && \result + 1073741823 <= 0) && ntStatus + 1073741823 <= 0) && MaximumInterfaceType <= 0) || ((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && __cil_tmp42 <= 259) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && \result + 1073741823 <= 0) && myStatus + 1073741637 <= 0) && ntStatus + 1073741823 <= 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((myStatus == 0 && ntStatus == 0) && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((myStatus == 0 && ntStatus == 0) && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((myStatus == 0 && ntStatus == 0) && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((myStatus == 0 && ntStatus == 0) && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((myStatus == 0 && (ntStatus == 0 && status == 0) && DC + 5 <= IPC && ((((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) || ((myStatus + 1073741637 <= 0 && (ntStatus == 0 && status == 0) && DC + 5 <= IPC && ((((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s + 5 <= MPR3) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount [2019-11-19 23:38:05,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((myStatus == 0 && DC + 5 <= IPC && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) || (((DC + 5 <= IPC && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0)) || ((DC + 5 <= IPC && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result == 0) [2019-11-19 23:38:05,018 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && (((0 == pended && status == 0) && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && \result + 1073741670 <= 0) || (((ntStatus + 1073741637 <= 0 && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && (((0 == pended && status == 0) && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0)) || (((((myStatus == 0 && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && (((0 == pended && status == 0) && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && ntStatus == 0) && \result == 0) || (!(259 == __cil_tmp11) && ((((((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && (((0 == pended && status == 0) && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && ntStatus == 0) && 0 == returnVal2) && \result == 0)) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,018 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == ntStatus && ((myStatus == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) || ((!(259 == __cil_tmp11) && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 == returnVal2))) && status == 0) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0 [2019-11-19 23:38:05,018 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((myStatus == 0 && 0 == ntStatus) && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) || (((!(259 == __cil_tmp11) && 0 == ntStatus) && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 == returnVal2)) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0 [2019-11-19 23:38:05,018 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == ntStatus && status == 0) && 0 <= InterfaceType) && ((ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 < ntStatus + 1) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) || (((0 == ntStatus && 0 == \result) && status == 0) && ((ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 < ntStatus + 1)) || (((((((myStatus == 0 && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ((ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 < ntStatus + 1) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,018 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == ntStatus && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 == \result) || ((((ntStatus + 1073741637 <= 0 && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus + 1073741637 <= 0)) || ((((((0 == ntStatus && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((myStatus == 0 && 0 == ntStatus) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-19 23:38:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((myStatus == 0 && (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (MaximumInterfaceType <= 0 && ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) [2019-11-19 23:38:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && 0 == \result) && lowerDriverReturn <= returnVal2) && PagingReferenceCount <= 1) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ntStatus == 0) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount [2019-11-19 23:38:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == \result && 0 == ntStatus) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) || (((((((0 == \result && myStatus == 0) && 0 == ntStatus) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || (((0 == \result && 0 == ntStatus) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 == \result)) || (((((ntStatus + 1073741637 <= 0 && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus + 1073741637 <= 0)) || (((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) [2019-11-19 23:38:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount [2019-11-19 23:38:05,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((myStatus == 0 && ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (returnVal2 + 1073741823 <= 0 && DC + 5 <= IPC && (ntStatus == 0 && status == 0) && (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount)))) || ((((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0)) || ((DC + 5 <= IPC && (ntStatus == 0 && status == 0) && (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount))) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((myStatus + 1073741637 <= 0 && (((((ntStatus == 0 && (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && 259 == returnVal2) && status == 0) && MPR3 == s) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) || ((0 == returnVal2 && ((DC + 5 <= IPC && status == 0) && (ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && lowerDriverReturn == returnVal2) && !(259 == returnVal2)) && MaximumInterfaceType <= 0)) || ((myStatus == 0 && (((((ntStatus == 0 && (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && 259 == returnVal2) && status == 0) && MPR3 == s) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && MaximumInterfaceType <= 0)) || ((((DC + 5 <= IPC && status == 0) && (ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && lowerDriverReturn == returnVal2) && !(259 == returnVal2)) && returnVal2 + 1073741823 <= 0) [2019-11-19 23:38:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((myStatus == 0 && DC + 5 <= IPC) && (((((((((((((((((((0 == pended && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (((((DC + 5 <= IPC && status == 0) && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(259 == returnVal2)) && 0 == returnVal2) && MaximumInterfaceType <= 0)) || ((DC + 5 <= IPC && (((((((((((((((((((0 == pended && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0)) || ((((DC + 5 <= IPC && status == 0) && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(259 == returnVal2)) && returnVal2 + 1073741823 <= 0) [2019-11-19 23:38:05,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount [2019-11-19 23:38:05,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((myStatus == 0 && (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) [2019-11-19 23:38:05,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((myStatus == 0 && ((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && (((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && (((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || ((myStatus == 0 && DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || ((myStatus == 0 && DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,022 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || ((myStatus == 0 && DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,023 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || ((myStatus == 0 && DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && MaximumInterfaceType <= 0) [2019-11-19 23:38:05,162 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_24674417-6d09-414a-bd9b-ec5ac0481479/bin/uautomizer/witness.graphml [2019-11-19 23:38:05,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:38:05,163 INFO L168 Benchmark]: Toolchain (without parser) took 76704.88 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 939.3 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 55.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:05,164 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:38:05,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 554.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:05,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:05,165 INFO L168 Benchmark]: Boogie Preprocessor took 119.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:05,165 INFO L168 Benchmark]: RCFGBuilder took 1567.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.0 MB in the end (delta: 143.9 MB). Peak memory consumption was 143.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:05,165 INFO L168 Benchmark]: TraceAbstraction took 74098.60 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 972.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-19 23:38:05,166 INFO L168 Benchmark]: Witness Printer took 273.46 ms. Allocated memory is still 2.5 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 76.3 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:05,168 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 554.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1567.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.0 MB in the end (delta: 143.9 MB). Peak memory consumption was 143.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74098.60 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 972.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 273.46 ms. Allocated memory is still 2.5 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 76.3 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((myStatus == 0 && (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && NP == s) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) || ((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && NP == s) && MaximumInterfaceType <= 0) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 899]: Loop Invariant Derived loop invariant: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 877]: Loop Invariant Derived loop invariant: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 899]: Loop Invariant Derived loop invariant: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == status && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1121]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && 0 == returnVal2) && lowerDriverReturn == returnVal2) || (((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && returnVal2 + 1073741823 <= 0) && lowerDriverReturn == returnVal2)) || (((((((((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (((0 == pended && NP + 5 <= MPR3) && 1 <= compRegistered) && setEventCalled == 1) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && myStatus == 0) && ntStatus == 0) && DC + 5 <= IPC) && 259 == returnVal2) && status == 0) && MPR3 == s) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= s) && SKIP1 == s) && 0 < PagingReferenceCount - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: ((myStatus == 0 && ((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && (((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && (((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 833]: Loop Invariant Derived loop invariant: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((0 == ntStatus && ((myStatus == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) || ((!(259 == __cil_tmp11) && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 == returnVal2))) && status == 0) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount - InvariantResult [Line: 818]: Loop Invariant Derived loop invariant: ((myStatus == 0 && (ntStatus == 0 && status == 0) && DC + 5 <= IPC && ((((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) || ((myStatus + 1073741637 <= 0 && (ntStatus == 0 && status == 0) && DC + 5 <= IPC && ((((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) - InvariantResult [Line: 808]: Loop Invariant Derived loop invariant: (((myStatus == 0 && DC + 5 <= IPC && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) || (((DC + 5 <= IPC && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0)) || ((DC + 5 <= IPC && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((myStatus == 0 && (((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && __cil_tmp42 <= 259) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && \result + 1073741823 <= 0) && ntStatus + 1073741823 <= 0) && MaximumInterfaceType <= 0) || ((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && __cil_tmp42 <= 259) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && 258 < __cil_tmp42) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && \result + 1073741823 <= 0) && myStatus + 1073741637 <= 0) && ntStatus + 1073741823 <= 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && MaximumInterfaceType <= 0) && 0 < PagingReferenceCount) || (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) && 0 < PagingReferenceCount) - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s == MPR1 && myStatus == 0) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == status && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && ((NP + 5 <= MPR3 && 0 == pended) && 0 == compRegistered) && status == 0) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) || ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && ((NP + 5 <= MPR3 && 0 == pended) && 0 == compRegistered) && status == 0) && 0 == returnVal2) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && 0 == \result) && lowerDriverReturn <= returnVal2) && PagingReferenceCount <= 1) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ntStatus == 0) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && 0 < ntStatus + 1) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || ((myStatus == 0 && DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && MaximumInterfaceType <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= s) && SKIP1 == s) && 0 < PagingReferenceCount - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount - InvariantResult [Line: 668]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp30 == 259) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 1123]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: ((((((((0 == ntStatus && status == 0) && 0 <= InterfaceType) && ((ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 < ntStatus + 1) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) || (((0 == ntStatus && 0 == \result) && status == 0) && ((ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 < ntStatus + 1)) || (((((((myStatus == 0 && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ((ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 < ntStatus + 1) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((myStatus == 0 && (((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || ((((((((((((((((((((((0 == pended && DC + 5 <= IPC) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || ((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && status == 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && MPR3 == s) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((myStatus == 0 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 0 < PagingReferenceCount - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: (((((myStatus == 0 && ntStatus == 0) && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == status) && lowerDriverReturn == \result) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) || ((((((0 == \result && (((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && 0 == \result) && status == 0)) || ((((((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && (((NP + 2 <= SKIP1 && 0 == pended) && NP + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((NP + 5 <= MPR3 && 0 == \result + 1073741823) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0)) || ((((ntStatus == 0 && 0 == \result) && ((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && status == 0) && 0 == returnVal2)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == \result) && 0 <= \result) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == 0) && NP + 5 <= MPR3) && \result <= 0)) || ((((((((status + 1073741637 <= 0 && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && (((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && status == 0) && (((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC)) || ((((((\result + 1073741670 <= 0 && (((DC + 2 <= SKIP2 && (((((((((NP + 2 <= SKIP1 && (0 == pended && NP + 5 <= MPR3) && s == DC) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == status && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((((0 == ntStatus && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 == \result) || ((((ntStatus + 1073741637 <= 0 && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus + 1073741637 <= 0)) || ((((((0 == ntStatus && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((myStatus == 0 && 0 == ntStatus) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= s) && SKIP1 == s) && 0 < PagingReferenceCount - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && (((0 == pended && status == 0) && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && \result + 1073741670 <= 0) || (((ntStatus + 1073741637 <= 0 && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && (((0 == pended && status == 0) && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0)) || (((((myStatus == 0 && (((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && (((0 == pended && status == 0) && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && ntStatus == 0) && \result == 0) || (!(259 == __cil_tmp11) && ((((((ntStatus == 0 && ((((((((((NP + 2 <= SKIP1 && (((0 == pended && status == 0) && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && ntStatus == 0) && 0 == returnVal2) && \result == 0)) && MaximumInterfaceType <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((myStatus + 1073741637 <= 0 && (((((ntStatus == 0 && (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && 259 == returnVal2) && status == 0) && MPR3 == s) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) || ((0 == returnVal2 && ((DC + 5 <= IPC && status == 0) && (ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && lowerDriverReturn == returnVal2) && !(259 == returnVal2)) && MaximumInterfaceType <= 0)) || ((myStatus == 0 && (((((ntStatus == 0 && (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && 259 == returnVal2) && status == 0) && MPR3 == s) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && MaximumInterfaceType <= 0)) || ((((DC + 5 <= IPC && status == 0) && (ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && lowerDriverReturn == returnVal2) && !(259 == returnVal2)) && returnVal2 + 1073741823 <= 0) - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: (((((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && (NP + 5 <= MPR3 && 0 == pended) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == \result) && 0 <= \result) && 0 == returnVal2) || (((((lowerDriverReturn == status && lowerDriverReturn == \result) && ((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2)) || ((((((0 == \result && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && 0 == \result) && (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 5 <= IPC) && status == 0)) || ((((NP + 5 <= MPR3 && 0 == \result + 1073741823) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 5 <= IPC) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 5 <= IPC) && status == 0)) || ((((((((status + 1073741637 <= 0 && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 5 <= IPC) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || (((((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && ((NP + 2 <= SKIP1 && (NP + 5 <= MPR3 && 0 == pended) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((ntStatus == 0 && 0 == \result) && status == 0) && ((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && (NP + 5 <= MPR3 && 0 == pended) && s == DC) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((0 == \result && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) || (((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2)) || (((ntStatus + 1073741823 <= 0 && DC + 5 <= IPC) && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && returnVal2 + 1073741823 <= 0)) || ((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus == 0) && 0 == returnVal2)) || ((((((ntStatus + 1073741637 <= 0 && \result + 1073741637 <= 0) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || (((((\result + 1073741670 <= 0 && DC + 5 <= IPC) && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((NP + 5 <= MPR3 && s == DC) && status == 0) && ntStatus + 1073741823 == 0) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s == MPR1 && myStatus == 0) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 886]: Loop Invariant Derived loop invariant: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 864]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 854]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((myStatus == 0 && (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (MaximumInterfaceType <= 0 && ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) - InvariantResult [Line: 820]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s + 5 <= MPR3) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 905]: Loop Invariant Derived loop invariant: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 839]: Loop Invariant Derived loop invariant: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && myStatus == 0) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status <= lowerDriverReturn) && 0 <= PagingReferenceCount) && MaximumInterfaceType <= 0) && lowerDriverReturn <= status - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && ntStatus == 0) && 0 == \result) && status == 0) && 0 == returnVal2) || ((((((((status + 1073741637 <= 0 && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && DC + 5 <= IPC && (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && NP + 5 <= MPR3) && \result <= 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == \result) && 0 <= \result) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && (((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && DC + 5 <= IPC && (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && status == 0)) || ((((((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && DC + 5 <= IPC && (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((((0 == \result && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && 0 == \result) && status == 0) && DC + 5 <= IPC && (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP + 5 <= MPR3 && s == DC) && 0 <= \result + 1073741802) && 0 <= PagingReferenceCount) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((((((myStatus == 0 && 0 == ntStatus) && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) || (((!(259 == __cil_tmp11) && 0 == ntStatus) && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 5 <= IPC) && 0 == returnVal2)) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((NP + 2 <= SKIP1 && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && 0 < PagingReferenceCount - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 905]: Loop Invariant Derived loop invariant: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s == MPR1 && myStatus == 0) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 1056]: Loop Invariant Derived loop invariant: ((((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp30 == 259) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && status == 0) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: (((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == status && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1093]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= s) && SKIP1 == s) && 0 < PagingReferenceCount - InvariantResult [Line: 1071]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1100]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((((((((((0 == \result && 0 == ntStatus) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) || (((((((0 == \result && myStatus == 0) && 0 == ntStatus) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || (((0 == \result && 0 == ntStatus) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 == \result)) || (((((ntStatus + 1073741637 <= 0 && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus + 1073741637 <= 0)) || (((\result + 1073741670 <= 0 && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && DC + 5 <= IPC && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && s == DC) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= s) && SKIP1 == s) && 0 < PagingReferenceCount - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && MaximumInterfaceType <= 0) && 0 < PagingReferenceCount) || (((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) && 0 < PagingReferenceCount) - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s == MPR1 && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((ntStatus == 0 && DC + 5 <= IPC) && (((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount))) - InvariantResult [Line: 1056]: Loop Invariant Derived loop invariant: (((((myStatus == 0 && ntStatus == 0) && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: (((((((((((((((((\result + s + 1073741642 <= IPC && s + ntStatus + 1073741642 <= IPC) && \result + s + 1073741642 <= IPC) && status + 1073741642 <= 0) && ntStatus + DC + 1073741642 <= IPC) && ntStatus + DC + 1073741642 <= IPC) && \result + DC + 1073741642 <= IPC) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && myStatus + DC + 1073741642 <= IPC) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && NP + 5 <= MPR3) && \result <= 0) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && 0 == \result) && 0 <= \result) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((0 == \result && ntStatus == 0) && 0 == ntStatus) && 0 == \result) && 0 == \result) && status == 0) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC)) || ((((((((status + 1073741637 <= 0 && ntStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && myStatus + 1073741637 <= 0) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && ntStatus + 1073741637 <= 0)) || (SKIP2 == s && (((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2)) || ((((((status + 1073741675 <= 0 && s + ntStatus + 1073741675 <= IPC) && \result + s + 1073741675 <= IPC) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && \result + s + 1073741675 <= IPC) && s + ntStatus + 1073741675 <= IPC) && \result + DC + 1073741675 <= IPC)) || ((((((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && \result + s + 1073741828 <= IPC) && returnVal2 + DC + 1073741828 <= IPC) && status + 1073741828 <= 0) && ntStatus + DC + 1073741828 <= IPC)) || ((((myStatus == 0 && ntStatus == 0) && 0 == \result) && status == 0) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC)) || ((((((\result + 1073741670 <= 0 && \result + 1073741670 <= 0) && ((((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((ntStatus == 0 && 0 == \result) && status == 0) && (((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && lowerDriverReturn <= returnVal2) && (((NP + 5 <= MPR3 && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) && DC + 2 <= SKIP2) && 0 == returnVal2) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 1056]: Loop Invariant Derived loop invariant: ((DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || ((myStatus == 0 && DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && MaximumInterfaceType <= 0) - InvariantResult [Line: 1056]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 731]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && NP == s) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) || ((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && status == 0) && PagingReferenceCount <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && NP == s) && MaximumInterfaceType <= 0) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s == MPR1 && myStatus == 0) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0)) || ((myStatus == 0 && (((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && 259 == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && returnVal2 + 1073741823 <= 0) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus == 0) && returnVal2 + 1073741823 <= 0) && MaximumInterfaceType <= 0)) || ((((((((((((((((((((((s == MPR1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((\result + 1073741670 <= 0 && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && \result + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && ntStatus + 1073741670 <= 0) && \result + 1073741670 <= 0) || (((myStatus == 0 && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && ntStatus == 0) && 0 == \result)) || (((ntStatus == 0 && 0 == \result) && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 == returnVal2)) || (((0 == \result && ntStatus == 0) && 0 == \result) && (0 == ntStatus && 0 == \result) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2)) || (((((((ntStatus + 1073741637 <= 0 && \result + 1073741637 <= 0) && ntStatus + 1073741637 <= 0) && \result + 1073741637 <= 0) && \result + 1073741637 <= 0) && DC + 5 <= IPC && ((DC + 2 <= SKIP2 && ((((((((NP + 2 <= SKIP1 && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && (((NP + 5 <= MPR3 && 0 == pended) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && PagingReferenceCount <= 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && myStatus + 1073741637 <= 0) && ntStatus + 1073741637 <= 0)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status == 0) && s == DC)) || (((((((((((NP + 2 <= SKIP1 && 0 == pended) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && 0 == \result) && 0 <= \result) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == 0) && NP + 5 <= MPR3) && \result <= 0)) || ((((NP + 5 <= MPR3 && 0 == \result + 1073741823) && s == DC) && status == 0) && ntStatus + 1073741823 == 0)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn)) || ((((lowerDriverReturn == \result && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((myStatus == 0 && ((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (returnVal2 + 1073741823 <= 0 && DC + 5 <= IPC && (ntStatus == 0 && status == 0) && (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount)))) || ((((((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0)) || ((DC + 5 <= IPC && (ntStatus == 0 && status == 0) && (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && 0 == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 + 1073741823 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount))) && MaximumInterfaceType <= 0) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((((((lowerDriverReturn == status && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s + 2 <= MPR1) && 0 < PagingReferenceCount) && SKIP1 == s) || (((((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && status == 0) && 0 == returnVal2) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn == 0) && NP + 5 <= MPR3) && s + 2 <= MPR1) && 0 < PagingReferenceCount) && SKIP1 == s) - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: ((DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || ((myStatus == 0 && DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && MaximumInterfaceType <= 0) - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s == MPR1 && myStatus == 0) && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((s == MPR1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: (((((((((((((((((s == MPR1 && NP + 2 <= SKIP1) && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: ((((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp30 == 259) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 907]: Loop Invariant Derived loop invariant: (((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && 0 == \result) && status == 0) || ((((((((myStatus == 0 && ntStatus == 0) && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && \result == 0) && MaximumInterfaceType <= 0)) || ((((((((ntStatus == 0 && DC + 5 <= IPC && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 == ntStatus) && status == 0) && 0 <= InterfaceType) && ntStatus == 0) && 0 == returnVal2) && \result == 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 907]: Loop Invariant Derived loop invariant: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == status && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 841]: Loop Invariant Derived loop invariant: ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 2 <= s) && SKIP1 == s) && 0 < PagingReferenceCount - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: ((((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && 0 == returnVal2) && lowerDriverReturn == returnVal2) || (((((ntStatus == 0 && DC + 5 <= IPC) && status == 0) && ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && \result <= lowerDriverReturn) && NP + 5 <= MPR3) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && returnVal2 + 1073741823 <= 0) && lowerDriverReturn == returnVal2)) || ((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: (((((myStatus == 0 && ntStatus == 0) && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP2 == s) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1080]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1058]: Loop Invariant Derived loop invariant: (((((myStatus == 0 && ntStatus == 0) && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && MaximumInterfaceType <= 0) || (((((ntStatus == 0 && (((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && 258 < __cil_tmp42) && __cil_tmp42 <= 259) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && DC + 5 <= IPC) && status == 0) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && myStatus + 1073741637 <= 0) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || ((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount - InvariantResult [Line: 1058]: Loop Invariant Derived loop invariant: ((DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && myStatus + 1073741637 <= 0) || ((myStatus == 0 && DC + 5 <= IPC && status == 0 && (ntStatus == 0 && ((((returnVal2 <= lowerDriverReturn && \result <= lowerDriverReturn) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && ((0 == pended && NP == s) && s + 5 <= MPR3) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) && 259 == __cil_tmp11) && MaximumInterfaceType <= 0) - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) || (((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || (((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && returnVal2 + 1073741823 <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || (((((((((((((((((((((((myStatus == 0 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount)) || (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 <= __cil_tmp7 + 1073741802) && NP == s) && myStatus + 1073741637 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && lowerDriverReturn == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && MaximumInterfaceType <= 0) && setEventCalled == 1) && 0 < PagingReferenceCount) - InvariantResult [Line: 1058]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == compRegistered) && DC + 2 <= SKIP2) && NP == s) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: ((((myStatus == 0 && DC + 5 <= IPC) && ((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount) && status == 0) && MaximumInterfaceType <= 0) || ((((DC + 5 <= IPC && ((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0) && status == 0) && MaximumInterfaceType <= 0) - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((myStatus == 0 && DC + 5 <= IPC) && (((((((((((((((((((0 == pended && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && MaximumInterfaceType <= 0) || (((((DC + 5 <= IPC && status == 0) && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(259 == returnVal2)) && 0 == returnVal2) && MaximumInterfaceType <= 0)) || ((DC + 5 <= IPC && (((((((((((((((((((0 == pended && PagingReferenceCount <= 1) && \result + 1073741802 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && ntStatus == 0) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && MPR3 == s) && lowerDriverReturn == \result) && 259 == \result) && lowerDriverReturn == returnVal2) && setEventCalled == 1) && 0 < PagingReferenceCount) && myStatus + 1073741637 <= 0)) || ((((DC + 5 <= IPC && status == 0) && ((ntStatus == 0 && ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) && 0 < PagingReferenceCount) && lowerDriverReturn == \result) && lowerDriverReturn == returnVal2) && !(259 == returnVal2)) && returnVal2 + 1073741823 <= 0) - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 1058]: Loop Invariant Derived loop invariant: ((((((((((((((((((((myStatus == 0 && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && 1 <= compRegistered) && __cil_tmp30 == 259) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= \result + 1073741802) && NP == s) && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && lowerDriverReturn == returnVal2) && 0 < PagingReferenceCount - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && PagingReferenceCount <= 1) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result <= lowerDriverReturn) && ((NP + 5 <= MPR3 && 0 == pended) && 0 == compRegistered) && status == 0) && lowerDriverReturn <= \result) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount) || (((((((((NP + 2 <= SKIP1 && lowerDriverReturn == 0) && ((NP + 5 <= MPR3 && 0 == pended) && 0 == compRegistered) && status == 0) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == \result) && 0 == returnVal2) && 0 < PagingReferenceCount) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && myStatus == 0) && lowerDriverReturn == status) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && \result + 1073741802 <= 0) && status == 0) && 1 <= compRegistered) && SKIP2 + NP + 5 <= IPC + SKIP1) && ntStatus == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= \result + 1073741802) && NP == s) && setEventCalled == 1) && 0 < PagingReferenceCount - InvariantResult [Line: 964]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && PagingReferenceCount <= 1) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && 0 < PagingReferenceCount) && SKIP1 == s - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1102]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP == s) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 419 locations, 40 error locations. Result: SAFE, OverallTime: 73.8s, OverallIterations: 54, TraceHistogramMax: 2, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 53.1s, HoareTripleCheckerStatistics: 18792 SDtfs, 19099 SDslu, 40629 SDs, 0 SdLazy, 7379 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=758occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 54 MinimizatonAttempts, 4237 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 164 LocationsWithAnnotation, 164 PreInvPairs, 581 NumberOfFragments, 23663 HoareAnnotationTreeSize, 164 FomulaSimplifications, 14223112621805 FormulaSimplificationTreeSizeReduction, 6.7s HoareSimplificationTime, 164 FomulaSimplificationsInter, 959538082947 FormulaSimplificationTreeSizeReductionInter, 46.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2571 NumberOfCodeBlocks, 2571 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 2516 ConstructedInterpolants, 0 QuantifiedInterpolants, 380868 SizeOfPredicates, 2 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 55 InterpolantComputations, 54 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...