/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:31:25,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:31:25,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:31:25,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:31:25,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:31:25,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:31:25,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:31:25,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:31:25,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:31:25,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:31:25,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:31:25,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:31:25,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:31:25,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:31:25,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:31:25,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:31:25,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:31:25,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:31:25,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:31:25,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:31:25,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:31:25,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:31:25,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:31:25,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:31:25,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:31:25,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:31:25,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:31:25,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:31:25,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:31:25,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:31:25,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:31:25,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:31:25,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:31:25,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:31:25,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:31:25,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:31:25,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:31:25,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:31:25,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:31:25,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:31:25,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:31:25,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:31:25,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:31:25,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:31:25,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:31:25,957 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:31:25,958 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:31:25,958 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:31:25,958 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:31:25,958 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:31:25,958 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:31:25,958 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:31:25,959 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:31:25,959 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:31:25,959 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:31:25,959 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:31:25,959 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:31:25,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:31:25,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:31:25,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:31:25,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:31:25,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:31:25,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:31:25,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:31:25,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:31:25,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:31:25,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:31:25,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:31:25,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:31:25,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:31:25,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:31:25,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:31:25,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:31:25,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:31:25,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:31:25,964 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:31:25,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:31:25,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:31:25,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:31:25,964 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:31:26,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:31:26,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:31:26,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:31:26,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:31:26,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:31:26,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-11-24 04:31:26,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c310f5e/03b47657f1104639abf6918a8f7a516b/FLAG9a9d44171 [2019-11-24 04:31:26,874 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:31:26,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-11-24 04:31:26,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c310f5e/03b47657f1104639abf6918a8f7a516b/FLAG9a9d44171 [2019-11-24 04:31:27,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c310f5e/03b47657f1104639abf6918a8f7a516b [2019-11-24 04:31:27,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:31:27,180 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:31:27,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:31:27,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:31:27,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:31:27,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:27,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac08993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27, skipping insertion in model container [2019-11-24 04:31:27,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:27,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:31:27,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:31:27,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:31:27,691 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:31:27,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:31:27,807 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:31:27,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27 WrapperNode [2019-11-24 04:31:27,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:31:27,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:31:27,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:31:27,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:31:27,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:27,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:27,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:31:27,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:31:27,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:31:27,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:31:27,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:27,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:27,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:27,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:28,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:28,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:28,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... [2019-11-24 04:31:28,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:31:28,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:31:28,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:31:28,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:31:28,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-24 04:31:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:31:28,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:31:28,355 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,381 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,387 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,412 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,425 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,435 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,445 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,451 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,453 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,469 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,478 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,484 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,491 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,496 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,497 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,501 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,504 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,509 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,512 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,516 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,526 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:28,533 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:31:30,016 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##674: assume !false; [2019-11-24 04:31:30,017 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##673: assume false; [2019-11-24 04:31:30,017 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##618: assume !false; [2019-11-24 04:31:30,017 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##617: assume false; [2019-11-24 04:31:30,017 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##296: assume !false; [2019-11-24 04:31:30,018 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##295: assume false; [2019-11-24 04:31:30,018 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##256: assume !false; [2019-11-24 04:31:30,018 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##255: assume false; [2019-11-24 04:31:30,018 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##217: assume !false; [2019-11-24 04:31:30,019 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##216: assume false; [2019-11-24 04:31:30,019 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##247: assume !false; [2019-11-24 04:31:30,019 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume false; [2019-11-24 04:31:30,019 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##724: assume !false; [2019-11-24 04:31:30,019 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##723: assume false; [2019-11-24 04:31:30,020 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-24 04:31:30,020 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-24 04:31:30,020 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##326: assume !false; [2019-11-24 04:31:30,021 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume false; [2019-11-24 04:31:30,023 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##335: assume !false; [2019-11-24 04:31:30,023 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##334: assume false; [2019-11-24 04:31:30,023 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##405: assume !false; [2019-11-24 04:31:30,023 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume false; [2019-11-24 04:31:30,023 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##412: assume false; [2019-11-24 04:31:30,023 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##413: assume !false; [2019-11-24 04:31:30,024 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##452: assume false; [2019-11-24 04:31:30,024 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##453: assume !false; [2019-11-24 04:31:30,024 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##483: assume !false; [2019-11-24 04:31:30,024 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##482: assume false; [2019-11-24 04:31:30,024 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##543: assume !false; [2019-11-24 04:31:30,025 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##542: assume false; [2019-11-24 04:31:30,025 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##98: assume !false; [2019-11-24 04:31:30,025 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume false; [2019-11-24 04:31:30,025 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume !false; [2019-11-24 04:31:30,026 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##172: assume !false; [2019-11-24 04:31:30,026 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##171: assume false; [2019-11-24 04:31:30,026 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2019-11-24 04:31:30,026 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2019-11-24 04:31:30,026 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##79: assume false; [2019-11-24 04:31:30,026 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##142: assume !false; [2019-11-24 04:31:30,027 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume false; [2019-11-24 04:31:30,027 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-24 04:31:30,027 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-24 04:31:30,027 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2019-11-24 04:31:30,027 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2019-11-24 04:31:31,209 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:31:31,210 INFO L284 CfgBuilder]: Removed 267 assume(true) statements. [2019-11-24 04:31:31,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:31:31 BoogieIcfgContainer [2019-11-24 04:31:31,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:31:31,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:31:31,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:31:31,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:31:31,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:31:27" (1/3) ... [2019-11-24 04:31:31,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354c9f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:31:31, skipping insertion in model container [2019-11-24 04:31:31,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:31:27" (2/3) ... [2019-11-24 04:31:31,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354c9f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:31:31, skipping insertion in model container [2019-11-24 04:31:31,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:31:31" (3/3) ... [2019-11-24 04:31:31,220 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-11-24 04:31:31,229 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:31:31,237 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 51 error locations. [2019-11-24 04:31:31,248 INFO L249 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2019-11-24 04:31:31,282 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:31:31,282 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:31:31,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:31:31,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:31:31,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:31:31,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:31:31,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:31:31,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:31:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states. [2019-11-24 04:31:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 04:31:31,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:31,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 04:31:31,329 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash -768211812, now seen corresponding path program 1 times [2019-11-24 04:31:31,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:31,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408063325] [2019-11-24 04:31:31,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:31,557 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-24 04:31:31,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408063325] [2019-11-24 04:31:31,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:31,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:31,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875367342] [2019-11-24 04:31:31,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:31,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:31,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:31,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:31,589 INFO L87 Difference]: Start difference. First operand 364 states. Second operand 3 states. [2019-11-24 04:31:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:32,118 INFO L93 Difference]: Finished difference Result 757 states and 1133 transitions. [2019-11-24 04:31:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:32,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-24 04:31:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:32,137 INFO L225 Difference]: With dead ends: 757 [2019-11-24 04:31:32,137 INFO L226 Difference]: Without dead ends: 428 [2019-11-24 04:31:32,142 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-24 04:31:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-24 04:31:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2019-11-24 04:31:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-24 04:31:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 575 transitions. [2019-11-24 04:31:32,212 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 575 transitions. Word has length 6 [2019-11-24 04:31:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:32,212 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 575 transitions. [2019-11-24 04:31:32,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 575 transitions. [2019-11-24 04:31:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:31:32,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:32,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:31:32,214 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1160131987, now seen corresponding path program 1 times [2019-11-24 04:31:32,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:32,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366623934] [2019-11-24 04:31:32,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:32,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-24 04:31:32,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366623934] [2019-11-24 04:31:32,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:32,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:31:32,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223673543] [2019-11-24 04:31:32,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:32,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:32,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:32,257 INFO L87 Difference]: Start difference. First operand 420 states and 575 transitions. Second operand 3 states. [2019-11-24 04:31:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:32,489 INFO L93 Difference]: Finished difference Result 442 states and 600 transitions. [2019-11-24 04:31:32,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:32,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 04:31:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:32,493 INFO L225 Difference]: With dead ends: 442 [2019-11-24 04:31:32,496 INFO L226 Difference]: Without dead ends: 420 [2019-11-24 04:31:32,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 04:31:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-24 04:31:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2019-11-24 04:31:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-24 04:31:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 574 transitions. [2019-11-24 04:31:32,545 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 574 transitions. Word has length 10 [2019-11-24 04:31:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:32,546 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 574 transitions. [2019-11-24 04:31:32,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 574 transitions. [2019-11-24 04:31:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:31:32,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:32,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:31:32,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1791311493, now seen corresponding path program 1 times [2019-11-24 04:31:32,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:32,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271829653] [2019-11-24 04:31:32,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:32,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-24 04:31:32,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271829653] [2019-11-24 04:31:32,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:32,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:32,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37499121] [2019-11-24 04:31:32,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:32,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:32,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:32,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:32,616 INFO L87 Difference]: Start difference. First operand 420 states and 574 transitions. Second operand 3 states. [2019-11-24 04:31:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:32,692 INFO L93 Difference]: Finished difference Result 838 states and 1150 transitions. [2019-11-24 04:31:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:32,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 04:31:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:32,698 INFO L225 Difference]: With dead ends: 838 [2019-11-24 04:31:32,698 INFO L226 Difference]: Without dead ends: 528 [2019-11-24 04:31:32,703 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-24 04:31:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-24 04:31:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 437. [2019-11-24 04:31:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-24 04:31:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 613 transitions. [2019-11-24 04:31:32,735 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 613 transitions. Word has length 10 [2019-11-24 04:31:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:32,735 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 613 transitions. [2019-11-24 04:31:32,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 613 transitions. [2019-11-24 04:31:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:31:32,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:32,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:31:32,740 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1189777912, now seen corresponding path program 1 times [2019-11-24 04:31:32,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:32,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234525540] [2019-11-24 04:31:32,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:32,843 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-24 04:31:32,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234525540] [2019-11-24 04:31:32,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:32,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:32,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199991199] [2019-11-24 04:31:32,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:32,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:32,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:32,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:32,848 INFO L87 Difference]: Start difference. First operand 437 states and 613 transitions. Second operand 3 states. [2019-11-24 04:31:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:33,060 INFO L93 Difference]: Finished difference Result 459 states and 639 transitions. [2019-11-24 04:31:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:33,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:31:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:33,065 INFO L225 Difference]: With dead ends: 459 [2019-11-24 04:31:33,065 INFO L226 Difference]: Without dead ends: 454 [2019-11-24 04:31:33,066 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-24 04:31:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-24 04:31:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2019-11-24 04:31:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-24 04:31:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 632 transitions. [2019-11-24 04:31:33,084 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 632 transitions. Word has length 15 [2019-11-24 04:31:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:33,084 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 632 transitions. [2019-11-24 04:31:33,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 632 transitions. [2019-11-24 04:31:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:31:33,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:33,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:31:33,086 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1190333017, now seen corresponding path program 1 times [2019-11-24 04:31:33,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:33,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904447669] [2019-11-24 04:31:33,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:33,131 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-24 04:31:33,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904447669] [2019-11-24 04:31:33,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:33,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:33,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728664737] [2019-11-24 04:31:33,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:33,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:33,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:33,138 INFO L87 Difference]: Start difference. First operand 451 states and 632 transitions. Second operand 3 states. [2019-11-24 04:31:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:33,239 INFO L93 Difference]: Finished difference Result 815 states and 1151 transitions. [2019-11-24 04:31:33,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:33,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:31:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:33,245 INFO L225 Difference]: With dead ends: 815 [2019-11-24 04:31:33,246 INFO L226 Difference]: Without dead ends: 784 [2019-11-24 04:31:33,247 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-24 04:31:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-24 04:31:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 732. [2019-11-24 04:31:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-11-24 04:31:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1070 transitions. [2019-11-24 04:31:33,284 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1070 transitions. Word has length 15 [2019-11-24 04:31:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:33,285 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 1070 transitions. [2019-11-24 04:31:33,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1070 transitions. [2019-11-24 04:31:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:31:33,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:33,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:31:33,293 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1388412693, now seen corresponding path program 1 times [2019-11-24 04:31:33,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:33,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428168482] [2019-11-24 04:31:33,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:33,368 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-24 04:31:33,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428168482] [2019-11-24 04:31:33,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:33,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:33,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51916056] [2019-11-24 04:31:33,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:33,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:33,371 INFO L87 Difference]: Start difference. First operand 732 states and 1070 transitions. Second operand 3 states. [2019-11-24 04:31:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:33,593 INFO L93 Difference]: Finished difference Result 732 states and 1070 transitions. [2019-11-24 04:31:33,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:33,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:31:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:33,598 INFO L225 Difference]: With dead ends: 732 [2019-11-24 04:31:33,598 INFO L226 Difference]: Without dead ends: 728 [2019-11-24 04:31:33,599 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-24 04:31:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-11-24 04:31:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2019-11-24 04:31:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-24 04:31:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1066 transitions. [2019-11-24 04:31:33,675 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1066 transitions. Word has length 15 [2019-11-24 04:31:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:33,675 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 1066 transitions. [2019-11-24 04:31:33,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1066 transitions. [2019-11-24 04:31:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:31:33,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:33,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:31:33,676 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1754010618, now seen corresponding path program 1 times [2019-11-24 04:31:33,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:33,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873847716] [2019-11-24 04:31:33,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:33,715 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-24 04:31:33,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873847716] [2019-11-24 04:31:33,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:33,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:33,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063758893] [2019-11-24 04:31:33,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:33,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:33,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:33,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:33,717 INFO L87 Difference]: Start difference. First operand 728 states and 1066 transitions. Second operand 3 states. [2019-11-24 04:31:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:33,762 INFO L93 Difference]: Finished difference Result 741 states and 1080 transitions. [2019-11-24 04:31:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:33,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 04:31:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:33,768 INFO L225 Difference]: With dead ends: 741 [2019-11-24 04:31:33,768 INFO L226 Difference]: Without dead ends: 726 [2019-11-24 04:31:33,768 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-24 04:31:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-11-24 04:31:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-11-24 04:31:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-11-24 04:31:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1063 transitions. [2019-11-24 04:31:33,802 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1063 transitions. Word has length 16 [2019-11-24 04:31:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:33,803 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1063 transitions. [2019-11-24 04:31:33,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1063 transitions. [2019-11-24 04:31:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:31:33,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:33,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:31:33,805 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:33,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash -135220526, now seen corresponding path program 1 times [2019-11-24 04:31:33,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:33,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253375664] [2019-11-24 04:31:33,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:33,859 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-24 04:31:33,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253375664] [2019-11-24 04:31:33,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:33,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:33,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540964668] [2019-11-24 04:31:33,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:33,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:33,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:33,862 INFO L87 Difference]: Start difference. First operand 726 states and 1063 transitions. Second operand 3 states. [2019-11-24 04:31:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:33,907 INFO L93 Difference]: Finished difference Result 1013 states and 1475 transitions. [2019-11-24 04:31:33,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:33,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 04:31:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:33,910 INFO L225 Difference]: With dead ends: 1013 [2019-11-24 04:31:33,910 INFO L226 Difference]: Without dead ends: 376 [2019-11-24 04:31:33,911 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-24 04:31:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-24 04:31:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-11-24 04:31:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-24 04:31:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 517 transitions. [2019-11-24 04:31:33,928 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 517 transitions. Word has length 16 [2019-11-24 04:31:33,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:33,936 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 517 transitions. [2019-11-24 04:31:33,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 517 transitions. [2019-11-24 04:31:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:31:33,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:33,937 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-24 04:31:33,938 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1287890101, now seen corresponding path program 1 times [2019-11-24 04:31:33,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:33,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045881144] [2019-11-24 04:31:33,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:33,990 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-24 04:31:33,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045881144] [2019-11-24 04:31:33,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:33,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:33,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882811654] [2019-11-24 04:31:33,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:33,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:33,993 INFO L87 Difference]: Start difference. First operand 376 states and 517 transitions. Second operand 3 states. [2019-11-24 04:31:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:34,029 INFO L93 Difference]: Finished difference Result 470 states and 620 transitions. [2019-11-24 04:31:34,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:34,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:31:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:34,031 INFO L225 Difference]: With dead ends: 470 [2019-11-24 04:31:34,032 INFO L226 Difference]: Without dead ends: 307 [2019-11-24 04:31:34,032 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-24 04:31:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-24 04:31:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2019-11-24 04:31:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-24 04:31:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 378 transitions. [2019-11-24 04:31:34,045 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 378 transitions. Word has length 19 [2019-11-24 04:31:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:34,046 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 378 transitions. [2019-11-24 04:31:34,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 378 transitions. [2019-11-24 04:31:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:31:34,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:34,047 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] [2019-11-24 04:31:34,047 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:34,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:34,047 INFO L82 PathProgramCache]: Analyzing trace with hash -175054370, now seen corresponding path program 1 times [2019-11-24 04:31:34,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:34,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186228033] [2019-11-24 04:31:34,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:34,072 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-24 04:31:34,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186228033] [2019-11-24 04:31:34,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:34,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:34,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832488749] [2019-11-24 04:31:34,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:34,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:34,074 INFO L87 Difference]: Start difference. First operand 294 states and 378 transitions. Second operand 3 states. [2019-11-24 04:31:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:34,287 INFO L93 Difference]: Finished difference Result 451 states and 582 transitions. [2019-11-24 04:31:34,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:34,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:31:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:34,290 INFO L225 Difference]: With dead ends: 451 [2019-11-24 04:31:34,290 INFO L226 Difference]: Without dead ends: 443 [2019-11-24 04:31:34,291 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-24 04:31:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-24 04:31:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 304. [2019-11-24 04:31:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-24 04:31:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 389 transitions. [2019-11-24 04:31:34,306 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 389 transitions. Word has length 20 [2019-11-24 04:31:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:34,307 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 389 transitions. [2019-11-24 04:31:34,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 389 transitions. [2019-11-24 04:31:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:31:34,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:34,308 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] [2019-11-24 04:31:34,309 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:34,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:34,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1930499273, now seen corresponding path program 1 times [2019-11-24 04:31:34,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:34,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387120603] [2019-11-24 04:31:34,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:34,342 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-24 04:31:34,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387120603] [2019-11-24 04:31:34,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:34,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:34,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242355870] [2019-11-24 04:31:34,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:34,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:34,345 INFO L87 Difference]: Start difference. First operand 304 states and 389 transitions. Second operand 3 states. [2019-11-24 04:31:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:34,515 INFO L93 Difference]: Finished difference Result 515 states and 671 transitions. [2019-11-24 04:31:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:34,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:31:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:34,518 INFO L225 Difference]: With dead ends: 515 [2019-11-24 04:31:34,518 INFO L226 Difference]: Without dead ends: 310 [2019-11-24 04:31:34,519 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-24 04:31:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-24 04:31:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-11-24 04:31:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-24 04:31:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 397 transitions. [2019-11-24 04:31:34,533 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 397 transitions. Word has length 20 [2019-11-24 04:31:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:34,533 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 397 transitions. [2019-11-24 04:31:34,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 397 transitions. [2019-11-24 04:31:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:31:34,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:34,534 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] [2019-11-24 04:31:34,535 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash -639564481, now seen corresponding path program 1 times [2019-11-24 04:31:34,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:34,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317807555] [2019-11-24 04:31:34,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:34,657 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-24 04:31:34,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317807555] [2019-11-24 04:31:34,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:34,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:31:34,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969038231] [2019-11-24 04:31:34,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:31:34,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:34,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:31:34,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:31:34,660 INFO L87 Difference]: Start difference. First operand 310 states and 397 transitions. Second operand 8 states. [2019-11-24 04:31:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:35,167 INFO L93 Difference]: Finished difference Result 332 states and 419 transitions. [2019-11-24 04:31:35,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:31:35,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-24 04:31:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:35,170 INFO L225 Difference]: With dead ends: 332 [2019-11-24 04:31:35,170 INFO L226 Difference]: Without dead ends: 327 [2019-11-24 04:31:35,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:31:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-24 04:31:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 320. [2019-11-24 04:31:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-24 04:31:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 407 transitions. [2019-11-24 04:31:35,189 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 407 transitions. Word has length 21 [2019-11-24 04:31:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:35,190 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 407 transitions. [2019-11-24 04:31:35,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:31:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 407 transitions. [2019-11-24 04:31:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:31:35,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:35,192 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] [2019-11-24 04:31:35,192 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash 51497316, now seen corresponding path program 1 times [2019-11-24 04:31:35,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:35,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168502905] [2019-11-24 04:31:35,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:35,222 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-24 04:31:35,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168502905] [2019-11-24 04:31:35,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:35,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:31:35,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099211279] [2019-11-24 04:31:35,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:35,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:35,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:35,224 INFO L87 Difference]: Start difference. First operand 320 states and 407 transitions. Second operand 4 states. [2019-11-24 04:31:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:35,265 INFO L93 Difference]: Finished difference Result 334 states and 422 transitions. [2019-11-24 04:31:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:35,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-24 04:31:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:35,267 INFO L225 Difference]: With dead ends: 334 [2019-11-24 04:31:35,267 INFO L226 Difference]: Without dead ends: 318 [2019-11-24 04:31:35,267 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-24 04:31:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-24 04:31:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-11-24 04:31:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-24 04:31:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 404 transitions. [2019-11-24 04:31:35,282 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 404 transitions. Word has length 21 [2019-11-24 04:31:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:35,283 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 404 transitions. [2019-11-24 04:31:35,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 404 transitions. [2019-11-24 04:31:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:31:35,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:35,284 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] [2019-11-24 04:31:35,284 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:35,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1114126484, now seen corresponding path program 1 times [2019-11-24 04:31:35,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:35,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486122314] [2019-11-24 04:31:35,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:35,317 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-24 04:31:35,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486122314] [2019-11-24 04:31:35,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:35,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:35,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218570556] [2019-11-24 04:31:35,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:35,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:35,320 INFO L87 Difference]: Start difference. First operand 318 states and 404 transitions. Second operand 4 states. [2019-11-24 04:31:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:35,576 INFO L93 Difference]: Finished difference Result 465 states and 596 transitions. [2019-11-24 04:31:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:35,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-24 04:31:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:35,579 INFO L225 Difference]: With dead ends: 465 [2019-11-24 04:31:35,579 INFO L226 Difference]: Without dead ends: 457 [2019-11-24 04:31:35,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 04:31:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-24 04:31:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 318. [2019-11-24 04:31:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-24 04:31:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 403 transitions. [2019-11-24 04:31:35,602 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 403 transitions. Word has length 21 [2019-11-24 04:31:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:35,604 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 403 transitions. [2019-11-24 04:31:35,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 403 transitions. [2019-11-24 04:31:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:31:35,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:35,606 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-24 04:31:35,606 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1115375726, now seen corresponding path program 1 times [2019-11-24 04:31:35,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:35,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925004687] [2019-11-24 04:31:35,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:31:35,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925004687] [2019-11-24 04:31:35,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:35,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:31:35,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728785056] [2019-11-24 04:31:35,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:31:35,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:35,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:31:35,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:31:35,693 INFO L87 Difference]: Start difference. First operand 318 states and 403 transitions. Second operand 8 states. [2019-11-24 04:31:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:36,186 INFO L93 Difference]: Finished difference Result 330 states and 414 transitions. [2019-11-24 04:31:36,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:31:36,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-24 04:31:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:36,189 INFO L225 Difference]: With dead ends: 330 [2019-11-24 04:31:36,189 INFO L226 Difference]: Without dead ends: 325 [2019-11-24 04:31:36,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:31:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-24 04:31:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2019-11-24 04:31:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-24 04:31:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2019-11-24 04:31:36,207 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 22 [2019-11-24 04:31:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:36,207 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2019-11-24 04:31:36,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:31:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2019-11-24 04:31:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:31:36,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:36,208 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-24 04:31:36,209 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:36,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash -711501959, now seen corresponding path program 1 times [2019-11-24 04:31:36,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:36,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826252717] [2019-11-24 04:31:36,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:36,263 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-24 04:31:36,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826252717] [2019-11-24 04:31:36,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:36,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:36,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426853525] [2019-11-24 04:31:36,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:36,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:36,265 INFO L87 Difference]: Start difference. First operand 319 states and 404 transitions. Second operand 5 states. [2019-11-24 04:31:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:36,454 INFO L93 Difference]: Finished difference Result 382 states and 469 transitions. [2019-11-24 04:31:36,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:31:36,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-24 04:31:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:36,458 INFO L225 Difference]: With dead ends: 382 [2019-11-24 04:31:36,458 INFO L226 Difference]: Without dead ends: 378 [2019-11-24 04:31:36,459 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-24 04:31:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-24 04:31:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 326. [2019-11-24 04:31:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-11-24 04:31:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 411 transitions. [2019-11-24 04:31:36,476 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 411 transitions. Word has length 22 [2019-11-24 04:31:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:36,477 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 411 transitions. [2019-11-24 04:31:36,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 411 transitions. [2019-11-24 04:31:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:31:36,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:36,478 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-24 04:31:36,478 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:36,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash -711513875, now seen corresponding path program 1 times [2019-11-24 04:31:36,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:36,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547291579] [2019-11-24 04:31:36,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:36,512 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-24 04:31:36,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547291579] [2019-11-24 04:31:36,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:36,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:36,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264365764] [2019-11-24 04:31:36,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:36,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:36,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:36,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:36,514 INFO L87 Difference]: Start difference. First operand 326 states and 411 transitions. Second operand 4 states. [2019-11-24 04:31:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:36,761 INFO L93 Difference]: Finished difference Result 465 states and 596 transitions. [2019-11-24 04:31:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:36,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-24 04:31:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:36,765 INFO L225 Difference]: With dead ends: 465 [2019-11-24 04:31:36,765 INFO L226 Difference]: Without dead ends: 443 [2019-11-24 04:31:36,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 04:31:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-24 04:31:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 310. [2019-11-24 04:31:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-24 04:31:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 392 transitions. [2019-11-24 04:31:36,784 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 392 transitions. Word has length 22 [2019-11-24 04:31:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:36,784 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 392 transitions. [2019-11-24 04:31:36,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 392 transitions. [2019-11-24 04:31:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:31:36,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:36,785 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-24 04:31:36,786 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1388815226, now seen corresponding path program 1 times [2019-11-24 04:31:36,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:36,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114454788] [2019-11-24 04:31:36,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:36,810 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-24 04:31:36,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114454788] [2019-11-24 04:31:36,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:36,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:36,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332655772] [2019-11-24 04:31:36,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:36,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:36,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:36,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:36,812 INFO L87 Difference]: Start difference. First operand 310 states and 392 transitions. Second operand 3 states. [2019-11-24 04:31:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:37,007 INFO L93 Difference]: Finished difference Result 409 states and 520 transitions. [2019-11-24 04:31:37,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:37,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:31:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:37,010 INFO L225 Difference]: With dead ends: 409 [2019-11-24 04:31:37,010 INFO L226 Difference]: Without dead ends: 397 [2019-11-24 04:31:37,011 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-24 04:31:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-24 04:31:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 322. [2019-11-24 04:31:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-24 04:31:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 410 transitions. [2019-11-24 04:31:37,034 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 410 transitions. Word has length 22 [2019-11-24 04:31:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:37,035 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 410 transitions. [2019-11-24 04:31:37,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 410 transitions. [2019-11-24 04:31:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:31:37,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:37,036 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-24 04:31:37,036 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 183305273, now seen corresponding path program 1 times [2019-11-24 04:31:37,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:37,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207390081] [2019-11-24 04:31:37,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:37,176 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-24 04:31:37,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207390081] [2019-11-24 04:31:37,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:37,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:31:37,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912474299] [2019-11-24 04:31:37,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:37,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:37,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:37,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:37,178 INFO L87 Difference]: Start difference. First operand 322 states and 410 transitions. Second operand 4 states. [2019-11-24 04:31:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:37,277 INFO L93 Difference]: Finished difference Result 526 states and 678 transitions. [2019-11-24 04:31:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:37,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-24 04:31:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:37,279 INFO L225 Difference]: With dead ends: 526 [2019-11-24 04:31:37,280 INFO L226 Difference]: Without dead ends: 299 [2019-11-24 04:31:37,280 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-24 04:31:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-24 04:31:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 286. [2019-11-24 04:31:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-24 04:31:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 356 transitions. [2019-11-24 04:31:37,301 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 356 transitions. Word has length 22 [2019-11-24 04:31:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:37,301 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 356 transitions. [2019-11-24 04:31:37,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 356 transitions. [2019-11-24 04:31:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:31:37,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:37,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] [2019-11-24 04:31:37,303 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -147048362, now seen corresponding path program 1 times [2019-11-24 04:31:37,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:37,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884129215] [2019-11-24 04:31:37,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:37,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-24 04:31:37,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884129215] [2019-11-24 04:31:37,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:37,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:37,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857437991] [2019-11-24 04:31:37,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:37,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:37,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:37,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:37,344 INFO L87 Difference]: Start difference. First operand 286 states and 356 transitions. Second operand 5 states. [2019-11-24 04:31:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:37,418 INFO L93 Difference]: Finished difference Result 293 states and 362 transitions. [2019-11-24 04:31:37,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:31:37,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:31:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:37,420 INFO L225 Difference]: With dead ends: 293 [2019-11-24 04:31:37,420 INFO L226 Difference]: Without dead ends: 276 [2019-11-24 04:31:37,421 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-24 04:31:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-24 04:31:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-11-24 04:31:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-24 04:31:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 345 transitions. [2019-11-24 04:31:37,445 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 345 transitions. Word has length 23 [2019-11-24 04:31:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:37,445 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 345 transitions. [2019-11-24 04:31:37,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 345 transitions. [2019-11-24 04:31:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:31:37,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:37,447 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-24 04:31:37,447 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 711985517, now seen corresponding path program 1 times [2019-11-24 04:31:37,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:37,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065592745] [2019-11-24 04:31:37,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:37,487 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-24 04:31:37,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065592745] [2019-11-24 04:31:37,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:37,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:37,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358523982] [2019-11-24 04:31:37,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:37,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:37,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:37,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:37,491 INFO L87 Difference]: Start difference. First operand 276 states and 345 transitions. Second operand 4 states. [2019-11-24 04:31:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:37,658 INFO L93 Difference]: Finished difference Result 301 states and 371 transitions. [2019-11-24 04:31:37,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:37,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-24 04:31:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:37,660 INFO L225 Difference]: With dead ends: 301 [2019-11-24 04:31:37,660 INFO L226 Difference]: Without dead ends: 276 [2019-11-24 04:31:37,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 04:31:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-24 04:31:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-11-24 04:31:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-24 04:31:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 343 transitions. [2019-11-24 04:31:37,683 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 343 transitions. Word has length 23 [2019-11-24 04:31:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:37,684 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 343 transitions. [2019-11-24 04:31:37,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 343 transitions. [2019-11-24 04:31:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:31:37,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:37,685 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-24 04:31:37,686 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1595980310, now seen corresponding path program 1 times [2019-11-24 04:31:37,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:37,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666992309] [2019-11-24 04:31:37,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:37,751 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-24 04:31:37,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666992309] [2019-11-24 04:31:37,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:37,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:37,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155409284] [2019-11-24 04:31:37,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:37,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:37,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:37,753 INFO L87 Difference]: Start difference. First operand 276 states and 343 transitions. Second operand 4 states. [2019-11-24 04:31:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:37,917 INFO L93 Difference]: Finished difference Result 467 states and 590 transitions. [2019-11-24 04:31:37,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:37,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-24 04:31:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:37,919 INFO L225 Difference]: With dead ends: 467 [2019-11-24 04:31:37,919 INFO L226 Difference]: Without dead ends: 276 [2019-11-24 04:31:37,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 04:31:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-24 04:31:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-11-24 04:31:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-24 04:31:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2019-11-24 04:31:37,940 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 23 [2019-11-24 04:31:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:37,940 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2019-11-24 04:31:37,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2019-11-24 04:31:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:31:37,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:37,941 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] [2019-11-24 04:31:37,941 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1707242064, now seen corresponding path program 1 times [2019-11-24 04:31:37,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:37,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809079237] [2019-11-24 04:31:37,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:37,960 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-24 04:31:37,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809079237] [2019-11-24 04:31:37,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:37,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:37,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146908347] [2019-11-24 04:31:37,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:37,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:37,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:37,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:37,962 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 3 states. [2019-11-24 04:31:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:38,075 INFO L93 Difference]: Finished difference Result 294 states and 351 transitions. [2019-11-24 04:31:38,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:38,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:31:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:38,077 INFO L225 Difference]: With dead ends: 294 [2019-11-24 04:31:38,077 INFO L226 Difference]: Without dead ends: 280 [2019-11-24 04:31:38,077 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-24 04:31:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-24 04:31:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 272. [2019-11-24 04:31:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-24 04:31:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 331 transitions. [2019-11-24 04:31:38,096 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 331 transitions. Word has length 24 [2019-11-24 04:31:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:38,096 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 331 transitions. [2019-11-24 04:31:38,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 331 transitions. [2019-11-24 04:31:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:31:38,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:38,097 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] [2019-11-24 04:31:38,098 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash -297473178, now seen corresponding path program 1 times [2019-11-24 04:31:38,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:38,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142740619] [2019-11-24 04:31:38,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:38,121 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-24 04:31:38,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142740619] [2019-11-24 04:31:38,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:38,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:38,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053001436] [2019-11-24 04:31:38,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:38,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:38,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:38,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:38,124 INFO L87 Difference]: Start difference. First operand 272 states and 331 transitions. Second operand 4 states. [2019-11-24 04:31:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:38,301 INFO L93 Difference]: Finished difference Result 275 states and 333 transitions. [2019-11-24 04:31:38,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:38,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-24 04:31:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:38,303 INFO L225 Difference]: With dead ends: 275 [2019-11-24 04:31:38,304 INFO L226 Difference]: Without dead ends: 260 [2019-11-24 04:31:38,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 04:31:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-24 04:31:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-11-24 04:31:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-24 04:31:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 317 transitions. [2019-11-24 04:31:38,362 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 317 transitions. Word has length 24 [2019-11-24 04:31:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:38,362 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 317 transitions. [2019-11-24 04:31:38,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 317 transitions. [2019-11-24 04:31:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:31:38,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:38,363 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] [2019-11-24 04:31:38,364 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1877026678, now seen corresponding path program 1 times [2019-11-24 04:31:38,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:38,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630735410] [2019-11-24 04:31:38,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:38,430 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-24 04:31:38,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630735410] [2019-11-24 04:31:38,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:38,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:38,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211621848] [2019-11-24 04:31:38,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:38,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:38,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:38,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:38,432 INFO L87 Difference]: Start difference. First operand 260 states and 317 transitions. Second operand 5 states. [2019-11-24 04:31:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:38,669 INFO L93 Difference]: Finished difference Result 281 states and 339 transitions. [2019-11-24 04:31:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:31:38,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 04:31:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:38,671 INFO L225 Difference]: With dead ends: 281 [2019-11-24 04:31:38,671 INFO L226 Difference]: Without dead ends: 275 [2019-11-24 04:31:38,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:31:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-24 04:31:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2019-11-24 04:31:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-24 04:31:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 317 transitions. [2019-11-24 04:31:38,691 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 317 transitions. Word has length 24 [2019-11-24 04:31:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:38,691 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 317 transitions. [2019-11-24 04:31:38,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 317 transitions. [2019-11-24 04:31:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:31:38,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:38,692 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-24 04:31:38,693 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1160180880, now seen corresponding path program 1 times [2019-11-24 04:31:38,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:38,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958055800] [2019-11-24 04:31:38,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:38,722 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-24 04:31:38,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958055800] [2019-11-24 04:31:38,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:38,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:38,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877305417] [2019-11-24 04:31:38,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:38,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:38,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:38,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:38,724 INFO L87 Difference]: Start difference. First operand 260 states and 317 transitions. Second operand 5 states. [2019-11-24 04:31:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:38,776 INFO L93 Difference]: Finished difference Result 273 states and 330 transitions. [2019-11-24 04:31:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:31:38,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 04:31:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:38,778 INFO L225 Difference]: With dead ends: 273 [2019-11-24 04:31:38,778 INFO L226 Difference]: Without dead ends: 250 [2019-11-24 04:31:38,779 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-24 04:31:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-24 04:31:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-11-24 04:31:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-24 04:31:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2019-11-24 04:31:38,797 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 25 [2019-11-24 04:31:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:38,797 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2019-11-24 04:31:38,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2019-11-24 04:31:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:31:38,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:38,798 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-24 04:31:38,798 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:38,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1367304742, now seen corresponding path program 1 times [2019-11-24 04:31:38,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:38,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538595785] [2019-11-24 04:31:38,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:38,948 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-24 04:31:38,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538595785] [2019-11-24 04:31:38,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:38,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:38,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548907965] [2019-11-24 04:31:38,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:38,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:38,949 INFO L87 Difference]: Start difference. First operand 250 states and 305 transitions. Second operand 5 states. [2019-11-24 04:31:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:39,053 INFO L93 Difference]: Finished difference Result 264 states and 318 transitions. [2019-11-24 04:31:39,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:31:39,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 04:31:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:39,055 INFO L225 Difference]: With dead ends: 264 [2019-11-24 04:31:39,055 INFO L226 Difference]: Without dead ends: 261 [2019-11-24 04:31:39,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:31:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-24 04:31:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 256. [2019-11-24 04:31:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-24 04:31:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2019-11-24 04:31:39,075 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 25 [2019-11-24 04:31:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:39,076 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2019-11-24 04:31:39,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2019-11-24 04:31:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:31:39,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:39,076 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-24 04:31:39,077 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:39,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1367316658, now seen corresponding path program 1 times [2019-11-24 04:31:39,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:39,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492076788] [2019-11-24 04:31:39,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:39,110 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-24 04:31:39,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492076788] [2019-11-24 04:31:39,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:39,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:39,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258899288] [2019-11-24 04:31:39,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:39,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:39,113 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 4 states. [2019-11-24 04:31:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:39,270 INFO L93 Difference]: Finished difference Result 261 states and 315 transitions. [2019-11-24 04:31:39,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:39,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-24 04:31:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:39,272 INFO L225 Difference]: With dead ends: 261 [2019-11-24 04:31:39,272 INFO L226 Difference]: Without dead ends: 241 [2019-11-24 04:31:39,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 04:31:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-24 04:31:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-24 04:31:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-24 04:31:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2019-11-24 04:31:39,290 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 25 [2019-11-24 04:31:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:39,291 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2019-11-24 04:31:39,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2019-11-24 04:31:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:31:39,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:39,292 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-24 04:31:39,292 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1492978729, now seen corresponding path program 1 times [2019-11-24 04:31:39,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:39,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161247821] [2019-11-24 04:31:39,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:39,314 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-24 04:31:39,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161247821] [2019-11-24 04:31:39,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:39,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:39,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677013859] [2019-11-24 04:31:39,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:39,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:39,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:39,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:39,316 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand 3 states. [2019-11-24 04:31:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:39,371 INFO L93 Difference]: Finished difference Result 446 states and 545 transitions. [2019-11-24 04:31:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:39,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:31:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:39,373 INFO L225 Difference]: With dead ends: 446 [2019-11-24 04:31:39,373 INFO L226 Difference]: Without dead ends: 267 [2019-11-24 04:31:39,374 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-24 04:31:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-24 04:31:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 217. [2019-11-24 04:31:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-24 04:31:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2019-11-24 04:31:39,396 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 25 [2019-11-24 04:31:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:39,397 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2019-11-24 04:31:39,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2019-11-24 04:31:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:31:39,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:39,398 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] [2019-11-24 04:31:39,398 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:39,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash -334860443, now seen corresponding path program 1 times [2019-11-24 04:31:39,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:39,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193302076] [2019-11-24 04:31:39,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:39,485 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-24 04:31:39,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193302076] [2019-11-24 04:31:39,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:39,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:39,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220911317] [2019-11-24 04:31:39,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:39,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:39,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:39,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:39,487 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand 5 states. [2019-11-24 04:31:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:39,608 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2019-11-24 04:31:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:31:39,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-24 04:31:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:39,609 INFO L225 Difference]: With dead ends: 217 [2019-11-24 04:31:39,610 INFO L226 Difference]: Without dead ends: 197 [2019-11-24 04:31:39,611 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-24 04:31:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-24 04:31:39,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-11-24 04:31:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-24 04:31:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 237 transitions. [2019-11-24 04:31:39,634 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 237 transitions. Word has length 27 [2019-11-24 04:31:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:39,634 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 237 transitions. [2019-11-24 04:31:39,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2019-11-24 04:31:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:31:39,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:39,635 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-24 04:31:39,636 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:39,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2107131655, now seen corresponding path program 1 times [2019-11-24 04:31:39,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:39,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456875828] [2019-11-24 04:31:39,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:39,689 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-24 04:31:39,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456875828] [2019-11-24 04:31:39,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:39,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:31:39,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122249251] [2019-11-24 04:31:39,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:31:39,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:39,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:31:39,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:39,690 INFO L87 Difference]: Start difference. First operand 197 states and 237 transitions. Second operand 4 states. [2019-11-24 04:31:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:39,817 INFO L93 Difference]: Finished difference Result 246 states and 297 transitions. [2019-11-24 04:31:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:31:39,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 04:31:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:39,819 INFO L225 Difference]: With dead ends: 246 [2019-11-24 04:31:39,819 INFO L226 Difference]: Without dead ends: 234 [2019-11-24 04:31:39,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:31:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-24 04:31:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2019-11-24 04:31:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-24 04:31:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 217 transitions. [2019-11-24 04:31:39,836 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 217 transitions. Word has length 28 [2019-11-24 04:31:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:39,837 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 217 transitions. [2019-11-24 04:31:39,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:31:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 217 transitions. [2019-11-24 04:31:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:31:39,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:39,837 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-24 04:31:39,838 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash -978718759, now seen corresponding path program 1 times [2019-11-24 04:31:39,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:39,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074098610] [2019-11-24 04:31:39,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:39,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-24 04:31:39,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074098610] [2019-11-24 04:31:39,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:39,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:39,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340885349] [2019-11-24 04:31:39,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:39,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:39,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:39,911 INFO L87 Difference]: Start difference. First operand 178 states and 217 transitions. Second operand 5 states. [2019-11-24 04:31:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:40,146 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2019-11-24 04:31:40,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:31:40,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-24 04:31:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:40,148 INFO L225 Difference]: With dead ends: 231 [2019-11-24 04:31:40,148 INFO L226 Difference]: Without dead ends: 227 [2019-11-24 04:31:40,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:31:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-24 04:31:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 168. [2019-11-24 04:31:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-24 04:31:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2019-11-24 04:31:40,165 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 37 [2019-11-24 04:31:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:40,165 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2019-11-24 04:31:40,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2019-11-24 04:31:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:31:40,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:40,166 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-24 04:31:40,166 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1340741965, now seen corresponding path program 1 times [2019-11-24 04:31:40,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:40,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197701712] [2019-11-24 04:31:40,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:40,305 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-24 04:31:40,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197701712] [2019-11-24 04:31:40,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:40,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:31:40,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568931496] [2019-11-24 04:31:40,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 04:31:40,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 04:31:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:31:40,308 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand 10 states. [2019-11-24 04:31:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:41,170 INFO L93 Difference]: Finished difference Result 255 states and 300 transitions. [2019-11-24 04:31:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 04:31:41,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-11-24 04:31:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:41,171 INFO L225 Difference]: With dead ends: 255 [2019-11-24 04:31:41,172 INFO L226 Difference]: Without dead ends: 237 [2019-11-24 04:31:41,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-11-24 04:31:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-24 04:31:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 168. [2019-11-24 04:31:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-24 04:31:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 203 transitions. [2019-11-24 04:31:41,195 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 203 transitions. Word has length 38 [2019-11-24 04:31:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:41,196 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 203 transitions. [2019-11-24 04:31:41,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 04:31:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2019-11-24 04:31:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:31:41,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:41,197 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] [2019-11-24 04:31:41,197 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash -387180546, now seen corresponding path program 1 times [2019-11-24 04:31:41,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:41,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604160648] [2019-11-24 04:31:41,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:41,312 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-24 04:31:41,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604160648] [2019-11-24 04:31:41,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:41,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:31:41,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079194995] [2019-11-24 04:31:41,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:31:41,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:41,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:31:41,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:31:41,314 INFO L87 Difference]: Start difference. First operand 168 states and 203 transitions. Second operand 8 states. [2019-11-24 04:31:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:41,494 INFO L93 Difference]: Finished difference Result 289 states and 353 transitions. [2019-11-24 04:31:41,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:31:41,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-11-24 04:31:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:41,495 INFO L225 Difference]: With dead ends: 289 [2019-11-24 04:31:41,496 INFO L226 Difference]: Without dead ends: 262 [2019-11-24 04:31:41,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:31:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-24 04:31:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2019-11-24 04:31:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-24 04:31:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 310 transitions. [2019-11-24 04:31:41,522 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 310 transitions. Word has length 39 [2019-11-24 04:31:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:41,523 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 310 transitions. [2019-11-24 04:31:41,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:31:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 310 transitions. [2019-11-24 04:31:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:31:41,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:41,524 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-24 04:31:41,524 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash -131041913, now seen corresponding path program 1 times [2019-11-24 04:31:41,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:41,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398350499] [2019-11-24 04:31:41,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:41,562 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-24 04:31:41,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398350499] [2019-11-24 04:31:41,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:41,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:31:41,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99600458] [2019-11-24 04:31:41,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:31:41,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:41,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:31:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:31:41,567 INFO L87 Difference]: Start difference. First operand 256 states and 310 transitions. Second operand 3 states. [2019-11-24 04:31:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:41,630 INFO L93 Difference]: Finished difference Result 423 states and 513 transitions. [2019-11-24 04:31:41,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:31:41,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:31:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:41,632 INFO L225 Difference]: With dead ends: 423 [2019-11-24 04:31:41,632 INFO L226 Difference]: Without dead ends: 297 [2019-11-24 04:31:41,633 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-24 04:31:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-24 04:31:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 256. [2019-11-24 04:31:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-24 04:31:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 308 transitions. [2019-11-24 04:31:41,661 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 308 transitions. Word has length 41 [2019-11-24 04:31:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:41,661 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 308 transitions. [2019-11-24 04:31:41,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:31:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 308 transitions. [2019-11-24 04:31:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:31:41,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:41,662 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-24 04:31:41,662 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:41,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2145103162, now seen corresponding path program 1 times [2019-11-24 04:31:41,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:41,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790937998] [2019-11-24 04:31:41,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:41,752 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-24 04:31:41,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790937998] [2019-11-24 04:31:41,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:41,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:31:41,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438742875] [2019-11-24 04:31:41,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:31:41,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:41,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:31:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:31:41,754 INFO L87 Difference]: Start difference. First operand 256 states and 308 transitions. Second operand 8 states. [2019-11-24 04:31:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:41,910 INFO L93 Difference]: Finished difference Result 277 states and 325 transitions. [2019-11-24 04:31:41,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:31:41,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-24 04:31:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:41,912 INFO L225 Difference]: With dead ends: 277 [2019-11-24 04:31:41,912 INFO L226 Difference]: Without dead ends: 240 [2019-11-24 04:31:41,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:31:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-24 04:31:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2019-11-24 04:31:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-24 04:31:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2019-11-24 04:31:41,947 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 41 [2019-11-24 04:31:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:41,947 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2019-11-24 04:31:41,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:31:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2019-11-24 04:31:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 04:31:41,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:41,948 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] [2019-11-24 04:31:41,948 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:41,949 INFO L82 PathProgramCache]: Analyzing trace with hash -9597068, now seen corresponding path program 1 times [2019-11-24 04:31:41,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:41,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123593853] [2019-11-24 04:31:41,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:42,039 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-24 04:31:42,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123593853] [2019-11-24 04:31:42,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:42,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:31:42,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948040391] [2019-11-24 04:31:42,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:31:42,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:42,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:31:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:31:42,043 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand 9 states. [2019-11-24 04:31:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:42,171 INFO L93 Difference]: Finished difference Result 240 states and 287 transitions. [2019-11-24 04:31:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:31:42,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-11-24 04:31:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:42,175 INFO L225 Difference]: With dead ends: 240 [2019-11-24 04:31:42,175 INFO L226 Difference]: Without dead ends: 213 [2019-11-24 04:31:42,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:31:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-24 04:31:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2019-11-24 04:31:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-24 04:31:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2019-11-24 04:31:42,189 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 42 [2019-11-24 04:31:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:42,190 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2019-11-24 04:31:42,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:31:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2019-11-24 04:31:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:31:42,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:42,190 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-24 04:31:42,191 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1624988854, now seen corresponding path program 1 times [2019-11-24 04:31:42,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:42,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019224630] [2019-11-24 04:31:42,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:42,263 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-24 04:31:42,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019224630] [2019-11-24 04:31:42,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:42,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:42,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300002813] [2019-11-24 04:31:42,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:42,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:42,265 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 5 states. [2019-11-24 04:31:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:42,410 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2019-11-24 04:31:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:31:42,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 04:31:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:42,412 INFO L225 Difference]: With dead ends: 174 [2019-11-24 04:31:42,412 INFO L226 Difference]: Without dead ends: 166 [2019-11-24 04:31:42,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:31:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-24 04:31:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2019-11-24 04:31:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-24 04:31:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2019-11-24 04:31:42,426 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 51 [2019-11-24 04:31:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:42,426 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2019-11-24 04:31:42,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2019-11-24 04:31:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 04:31:42,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:42,427 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] [2019-11-24 04:31:42,428 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash -674840559, now seen corresponding path program 1 times [2019-11-24 04:31:42,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:42,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069932841] [2019-11-24 04:31:42,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:42,526 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-24 04:31:42,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069932841] [2019-11-24 04:31:42,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:42,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:42,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555288704] [2019-11-24 04:31:42,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:42,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:42,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:42,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:42,528 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 5 states. [2019-11-24 04:31:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:42,709 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-24 04:31:42,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:31:42,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-24 04:31:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:42,710 INFO L225 Difference]: With dead ends: 154 [2019-11-24 04:31:42,710 INFO L226 Difference]: Without dead ends: 148 [2019-11-24 04:31:42,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:31:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-24 04:31:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 99. [2019-11-24 04:31:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-24 04:31:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2019-11-24 04:31:42,723 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 63 [2019-11-24 04:31:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:42,723 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2019-11-24 04:31:42,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2019-11-24 04:31:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 04:31:42,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:31:42,724 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] [2019-11-24 04:31:42,725 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:31:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:31:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 307052216, now seen corresponding path program 1 times [2019-11-24 04:31:42,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:31:42,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437264550] [2019-11-24 04:31:42,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:31:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:31:42,793 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-24 04:31:42,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437264550] [2019-11-24 04:31:42,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:31:42,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:31:42,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535520830] [2019-11-24 04:31:42,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:31:42,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:31:42,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:31:42,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:31:42,795 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 5 states. [2019-11-24 04:31:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:31:42,935 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2019-11-24 04:31:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:31:42,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-24 04:31:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:31:42,936 INFO L225 Difference]: With dead ends: 134 [2019-11-24 04:31:42,936 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:31:42,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:31:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:31:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:31:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:31:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:31:42,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2019-11-24 04:31:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:31:42,937 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:31:42,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:31:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:31:42,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:31:42,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:31:43,054 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 110 [2019-11-24 04:31:43,620 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 216 [2019-11-24 04:31:44,037 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-11-24 04:31:44,179 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 112 [2019-11-24 04:31:44,422 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 117 [2019-11-24 04:31:45,295 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 105 [2019-11-24 04:31:45,830 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2019-11-24 04:31:46,492 WARN L192 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 106 [2019-11-24 04:31:47,204 WARN L192 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 106 [2019-11-24 04:31:47,851 WARN L192 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2019-11-24 04:31:48,226 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-24 04:31:48,430 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-24 04:31:48,920 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-24 04:31:49,626 WARN L192 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 106 [2019-11-24 04:31:50,002 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-24 04:31:50,376 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2019-11-24 04:31:50,767 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-24 04:31:51,139 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-11-24 04:31:52,217 WARN L192 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 214 DAG size of output: 129 [2019-11-24 04:31:52,769 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-24 04:31:53,461 WARN L192 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 104 [2019-11-24 04:31:53,799 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-24 04:31:54,111 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-24 04:31:54,421 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-24 04:31:54,583 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-11-24 04:31:55,199 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-24 04:31:55,706 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-24 04:31:56,020 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-24 04:31:56,486 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-24 04:31:56,880 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2019-11-24 04:31:57,340 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-24 04:31:57,681 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-11-24 04:31:58,319 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2019-11-24 04:31:58,479 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-11-24 04:31:58,677 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-11-24 04:31:58,784 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-11-24 04:31:59,170 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-11-24 04:31:59,311 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-24 04:31:59,561 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-11-24 04:31:59,721 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-11-24 04:32:00,160 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-11-24 04:32:00,359 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-11-24 04:32:00,745 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-24 04:32:00,905 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-11-24 04:32:01,288 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-24 04:32:01,677 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-24 04:32:01,835 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-11-24 04:32:01,979 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-11-24 04:32:02,313 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-24 04:32:02,561 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-11-24 04:32:02,947 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-24 04:32:03,268 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-24 04:32:03,547 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-11-24 04:32:03,700 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-11-24 04:32:03,923 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-11-24 04:32:04,233 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-11-24 04:32:04,240 INFO L440 ceAbstractionStarter]: At program point L103(lines 103 130) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,240 INFO L444 ceAbstractionStarter]: For program point L1029(lines 1029 1033) no Hoare annotation was computed. [2019-11-24 04:32:04,240 INFO L444 ceAbstractionStarter]: For program point L1029-2(lines 1024 1034) no Hoare annotation was computed. [2019-11-24 04:32:04,241 INFO L440 ceAbstractionStarter]: At program point L106(lines 106 129) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,241 INFO L444 ceAbstractionStarter]: For program point L772(lines 772 776) no Hoare annotation was computed. [2019-11-24 04:32:04,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,241 INFO L444 ceAbstractionStarter]: For program point L1037(lines 1037 1041) no Hoare annotation was computed. [2019-11-24 04:32:04,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,241 INFO L444 ceAbstractionStarter]: For program point L509(lines 509 511) no Hoare annotation was computed. [2019-11-24 04:32:04,241 INFO L440 ceAbstractionStarter]: At program point L642(lines 699 701) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L440 ceAbstractionStarter]: At program point L778(lines 771 828) the Hoare annotation is: (let ((.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse14 (not (= 259 |ULTIMATE.start_DiskPerfDispatchPnp_#res|))) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (not (= 259 ULTIMATE.start_DiskPerfDispatchPnp_~status~0))) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (not (= ULTIMATE.start_main_~status~6 259)))) (or (let ((.cse7 (not (= ~s~0 ~NP~0)))) (and (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) .cse6 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258)) (or .cse7 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse9 .cse10 (or (<= 260 ULTIMATE.start_main_~status~6) (<= ULTIMATE.start_main_~status~6 258)) (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)))) (and .cse0 .cse9 .cse2 .cse10 .cse11 .cse4 .cse3 (or (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= 0 (+ ULTIMATE.start_PoCallDriver_~returnVal~0 1073741823))) (and (= ~lowerDriverReturn~0 0) (= 0 ULTIMATE.start_PoCallDriver_~returnVal~0)) (and (= ~lowerDriverReturn~0 259) (= 259 ULTIMATE.start_PoCallDriver_~returnVal~0))) .cse12) (= ~s~0 ~UNLOADED~0) (and .cse9 (<= ULTIMATE.start_main_~status~6 0) .cse5) (and .cse0 .cse13 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse2 .cse1 .cse14 .cse4 .cse5 .cse3 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse6 .cse15 .cse8 .cse9 .cse10 .cse16) (and .cse6 .cse9 .cse2 .cse10 .cse1 .cse4 (= ~IPC~0 ~s~0) .cse12) (and .cse6 .cse0 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse9 .cse2 .cse1 .cse10 .cse11 .cse4 .cse3 .cse12) (and .cse0 .cse13 .cse14 .cse2 .cse1 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse4 .cse5 .cse3 .cse6 .cse15 .cse8 .cse9 .cse10 .cse16))) [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point L517-2(lines 499 629) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 430) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 416) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point L386-2(lines 386 416) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point L255(lines 255 268) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point L255-1(lines 255 268) no Hoare annotation was computed. [2019-11-24 04:32:04,242 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,243 INFO L440 ceAbstractionStarter]: At program point L786(lines 779 827) the Hoare annotation is: (let ((.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse14 (not (= 259 |ULTIMATE.start_DiskPerfDispatchPnp_#res|))) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (not (= 259 ULTIMATE.start_DiskPerfDispatchPnp_~status~0))) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (not (= ULTIMATE.start_main_~status~6 259)))) (or (let ((.cse7 (not (= ~s~0 ~NP~0)))) (and (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) .cse6 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258)) (or .cse7 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse9 .cse10 (or (<= 260 ULTIMATE.start_main_~status~6) (<= ULTIMATE.start_main_~status~6 258)) (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)))) (and .cse0 .cse9 .cse2 .cse10 .cse11 .cse4 .cse3 (or (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= 0 (+ ULTIMATE.start_PoCallDriver_~returnVal~0 1073741823))) (and (= ~lowerDriverReturn~0 0) (= 0 ULTIMATE.start_PoCallDriver_~returnVal~0)) (and (= ~lowerDriverReturn~0 259) (= 259 ULTIMATE.start_PoCallDriver_~returnVal~0))) .cse12) (= ~s~0 ~UNLOADED~0) (and .cse9 (<= ULTIMATE.start_main_~status~6 0) .cse5) (and .cse0 .cse13 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse2 .cse1 .cse14 .cse4 .cse5 .cse3 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse6 .cse15 .cse8 .cse9 .cse10 .cse16) (and .cse6 .cse9 .cse2 .cse10 .cse1 .cse4 (= ~IPC~0 ~s~0) .cse12) (and .cse6 .cse0 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse9 .cse2 .cse1 .cse10 .cse11 .cse4 .cse3 .cse12) (and .cse0 .cse13 .cse14 .cse2 .cse1 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse4 .cse5 .cse3 .cse6 .cse15 .cse8 .cse9 .cse10 .cse16))) [2019-11-24 04:32:04,243 INFO L447 ceAbstractionStarter]: At program point L787(lines 771 828) the Hoare annotation is: true [2019-11-24 04:32:04,243 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 398) no Hoare annotation was computed. [2019-11-24 04:32:04,244 INFO L440 ceAbstractionStarter]: At program point L127(lines 110 128) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse11 (not (= 259 ULTIMATE.start_DiskPerfDispatchPnp_~status~0))) (.cse0 (<= .cse21 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 ~routine~0)) (.cse7 (= ~s~0 ~DC~0)) (.cse19 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse20 1) 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (not (= 1 ~pended~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~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)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (not (= ~s~0 ~NP~0)))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) .cse10 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258)) (or .cse18 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse18 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 0) .cse9 (<= ~myStatus~0 0) .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 0))))) [2019-11-24 04:32:04,244 INFO L440 ceAbstractionStarter]: At program point L920(lines 878 948) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,244 INFO L440 ceAbstractionStarter]: At program point L920-1(lines 878 948) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~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))) [2019-11-24 04:32:04,245 INFO L440 ceAbstractionStarter]: At program point L920-2(lines 878 948) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= ~myStatus~0 0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~MPR1~0 ~s~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,245 INFO L440 ceAbstractionStarter]: At program point L920-3(lines 878 948) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= ~myStatus~0 0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~MPR1~0 ~s~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,245 INFO L440 ceAbstractionStarter]: At program point L920-4(lines 878 948) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= ~myStatus~0 0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~MPR1~0 ~s~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,245 INFO L444 ceAbstractionStarter]: For program point L788(lines 788 825) no Hoare annotation was computed. [2019-11-24 04:32:04,245 INFO L440 ceAbstractionStarter]: At program point L920-5(lines 878 948) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= ~myStatus~0 0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~MPR1~0 ~s~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,246 INFO L440 ceAbstractionStarter]: At program point L920-6(lines 878 948) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~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))) [2019-11-24 04:32:04,246 INFO L440 ceAbstractionStarter]: At program point L920-7(lines 878 948) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:04,246 INFO L440 ceAbstractionStarter]: At program point L920-8(lines 878 948) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,246 INFO L444 ceAbstractionStarter]: For program point L524(lines 499 629) no Hoare annotation was computed. [2019-11-24 04:32:04,246 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 267) no Hoare annotation was computed. [2019-11-24 04:32:04,246 INFO L440 ceAbstractionStarter]: At program point L260-1(lines 1 1098) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,246 INFO L444 ceAbstractionStarter]: For program point L260-2(lines 260 267) no Hoare annotation was computed. [2019-11-24 04:32:04,246 INFO L440 ceAbstractionStarter]: At program point L260-3(lines 1 1098) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,246 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 824) no Hoare annotation was computed. [2019-11-24 04:32:04,246 INFO L444 ceAbstractionStarter]: For program point L790(lines 790 800) no Hoare annotation was computed. [2019-11-24 04:32:04,247 INFO L440 ceAbstractionStarter]: At program point L526(lines 526 528) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse19 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse19)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-24 04:32:04,247 INFO L444 ceAbstractionStarter]: For program point L791(lines 791 797) no Hoare annotation was computed. [2019-11-24 04:32:04,247 INFO L440 ceAbstractionStarter]: At program point L131(lines 94 133) the Hoare annotation is: (let ((.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse22 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse17 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse18 (not (= 259 |ULTIMATE.start_DiskPerfDispatchPnp_#res|))) (.cse20 (not (= 259 ULTIMATE.start_DiskPerfDispatchPnp_~status~0))) (.cse0 (<= .cse22 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= 0 ~routine~0)) (.cse6 (= ~s~0 ~DC~0)) (.cse19 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse21 1) 0)) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (not (= 1 ~pended~0))) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (<= 0 .cse22)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494)))) (or (let ((.cse10 (not (= ~s~0 ~NP~0)))) (and .cse0 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) .cse9 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258)) (or .cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse10 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)))) (and .cse0 .cse1 .cse17 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse17 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse9 .cse1 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse11 .cse2 .cse3 .cse13 (= ~SKIP2~0 ~s~0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 0) .cse8 (<= ~myStatus~0 0) .cse9 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 0))))) [2019-11-24 04:32:04,247 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,247 INFO L444 ceAbstractionStarter]: For program point L928(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point L928-1(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point L928-2(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point L928-3(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point L928-4(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point L928-5(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point L928-6(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point L928-7(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point L928-8(lines 928 945) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,248 INFO L440 ceAbstractionStarter]: At program point L402-2(lines 402 409) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,249 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,249 INFO L444 ceAbstractionStarter]: For program point L403(lines 402 409) no Hoare annotation was computed. [2019-11-24 04:32:04,249 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 538) no Hoare annotation was computed. [2019-11-24 04:32:04,249 INFO L440 ceAbstractionStarter]: At program point L1066(lines 1022 1097) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0) (<= (+ ~NP~0 2) ~s~0) (or (= 0 ULTIMATE.start_PoCallDriver_~returnVal~0) (= 259 ULTIMATE.start_PoCallDriver_~returnVal~0) (= 0 (+ ULTIMATE.start_PoCallDriver_~returnVal~0 1073741823))) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:04,249 INFO L440 ceAbstractionStarter]: At program point L802(lines 789 824) the Hoare annotation is: (let ((.cse1 (+ ~DC~0 2))) (let ((.cse3 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse8 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse10 (not (= 1 ~pended~0))) (.cse16 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse17 (<= .cse1 ~SKIP2~0)) (.cse18 (= 0 ~routine~0)) (.cse11 (= ~s~0 ~DC~0))) (let ((.cse0 (or (and .cse3 .cse10 .cse8 .cse16 .cse17 .cse18 .cse19) (and .cse10 .cse16 .cse17 .cse18 .cse11))) (.cse15 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse4 (not (= 259 ULTIMATE.start_DiskPerfDispatchPnp_~status~0))) (.cse5 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse7 (not (= 259 |ULTIMATE.start_DiskPerfDispatchPnp_#res|))) (.cse9 (not (= ULTIMATE.start_main_~status~6 259))) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (or (and .cse13 .cse0 .cse14 .cse15) (and .cse13 .cse10 .cse16 .cse17 (= ~SKIP2~0 ~s~0) .cse14 .cse18 (or (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= 0 (+ ULTIMATE.start_PoCallDriver_~returnVal~0 1073741823))) (and (= ~lowerDriverReturn~0 0) (= 0 ULTIMATE.start_PoCallDriver_~returnVal~0)) (and (= ~lowerDriverReturn~0 259) (= 259 ULTIMATE.start_PoCallDriver_~returnVal~0))) .cse19)))) (or (and (<= (+ ULTIMATE.start_main_~status~6 1073741789) 0) (<= (+ ULTIMATE.start_DiskPerfDeviceControl_~status~4 1073741789) 0) .cse0 (<= (+ |ULTIMATE.start_DiskPerfDeviceControl_#res| 1073741789) 0)) (and (<= .cse1 ~s~0) .cse2) (and .cse0 (<= (+ ~DC~0 5) ~s~0)) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse2 .cse9) (and .cse3 .cse4 .cse5 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse6 .cse8 .cse7 .cse2 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse9) (and .cse10 (<= ULTIMATE.start_main_~status~6 0) .cse11) (let ((.cse12 (not (= ~s~0 ~NP~0)))) (and .cse3 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258)) (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) (or .cse12 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse6 .cse8 (or (<= 260 ULTIMATE.start_main_~status~6) (<= ULTIMATE.start_main_~status~6 258)) .cse2 (or (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse12 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)))) (and .cse13 (= 0 ULTIMATE.start_DiskPerfDeviceControl_~status~4) (= 0 |ULTIMATE.start_DiskPerfDeviceControl_#res|) .cse0 (= ULTIMATE.start_main_~status~6 0) .cse14 .cse15)))))) [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 808) no Hoare annotation was computed. [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point L937-2(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point L937-4(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point L937-6(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point L937-8(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,250 INFO L444 ceAbstractionStarter]: For program point L937-10(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,251 INFO L444 ceAbstractionStarter]: For program point L937-12(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,251 INFO L444 ceAbstractionStarter]: For program point L937-14(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,251 INFO L444 ceAbstractionStarter]: For program point L937-16(lines 937 944) no Hoare annotation was computed. [2019-11-24 04:32:04,251 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 282) no Hoare annotation was computed. [2019-11-24 04:32:04,251 INFO L440 ceAbstractionStarter]: At program point L277-2(lines 277 282) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse19 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (= 0 ~routine~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (= 0 ~customIrp~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse19)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-24 04:32:04,251 INFO L444 ceAbstractionStarter]: For program point L277-3(lines 277 282) no Hoare annotation was computed. [2019-11-24 04:32:04,252 INFO L440 ceAbstractionStarter]: At program point L277-5(lines 277 282) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse17 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse17 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (= 0 ~routine~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse16 1) 0)) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (not (= 1 ~pended~0))) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse17)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 (= 0 ~customIrp~0) .cse8 (<= ~myStatus~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)) .cse14 (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse15)))) [2019-11-24 04:32:04,252 INFO L440 ceAbstractionStarter]: At program point L410(lines 401 411) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,252 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 549) no Hoare annotation was computed. [2019-11-24 04:32:04,252 INFO L444 ceAbstractionStarter]: For program point L544-2(lines 544 549) no Hoare annotation was computed. [2019-11-24 04:32:04,252 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1094) no Hoare annotation was computed. [2019-11-24 04:32:04,252 INFO L444 ceAbstractionStarter]: For program point L810(lines 810 822) no Hoare annotation was computed. [2019-11-24 04:32:04,252 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,252 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,252 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,252 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 815) no Hoare annotation was computed. [2019-11-24 04:32:04,253 INFO L440 ceAbstractionStarter]: At program point L681(lines 676 830) the Hoare annotation is: (let ((.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse14 (not (= 259 |ULTIMATE.start_DiskPerfDispatchPnp_#res|))) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (not (= 259 ULTIMATE.start_DiskPerfDispatchPnp_~status~0))) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (not (= ULTIMATE.start_main_~status~6 259)))) (or (let ((.cse7 (not (= ~s~0 ~NP~0)))) (and (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) .cse6 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258)) (or .cse7 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse9 .cse10 (or (<= 260 ULTIMATE.start_main_~status~6) (<= ULTIMATE.start_main_~status~6 258)) (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)))) (and .cse0 .cse9 .cse2 .cse10 .cse11 .cse4 .cse3 (or (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= 0 (+ ULTIMATE.start_PoCallDriver_~returnVal~0 1073741823))) (and (= ~lowerDriverReturn~0 0) (= 0 ULTIMATE.start_PoCallDriver_~returnVal~0)) (and (= ~lowerDriverReturn~0 259) (= 259 ULTIMATE.start_PoCallDriver_~returnVal~0))) .cse12) (and .cse9 (<= ULTIMATE.start_main_~status~6 0) .cse5) (= ~s~0 ~UNLOADED~0) (and .cse0 .cse13 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse2 .cse1 .cse14 .cse4 .cse5 .cse3 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse6 .cse15 .cse8 .cse9 .cse10 .cse16) (and .cse6 .cse9 .cse2 .cse10 .cse1 .cse4 (= ~IPC~0 ~s~0) .cse12) (and .cse6 .cse0 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse9 .cse2 .cse1 .cse10 .cse11 .cse4 .cse3 .cse12) (and .cse0 .cse13 .cse14 .cse2 .cse1 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse4 .cse5 .cse3 .cse6 .cse15 .cse8 .cse9 .cse10 .cse16))) [2019-11-24 04:32:04,253 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,253 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2019-11-24 04:32:04,253 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,253 INFO L444 ceAbstractionStarter]: For program point L553(lines 553 580) no Hoare annotation was computed. [2019-11-24 04:32:04,254 INFO L440 ceAbstractionStarter]: At program point L553-1(lines 524 622) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse19 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse19)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-24 04:32:04,254 INFO L440 ceAbstractionStarter]: At program point L555(lines 555 557) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse19 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse19)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-24 04:32:04,254 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,254 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1093) no Hoare annotation was computed. [2019-11-24 04:32:04,254 INFO L444 ceAbstractionStarter]: For program point L954(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:04,254 INFO L444 ceAbstractionStarter]: For program point L954-2(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:04,254 INFO L444 ceAbstractionStarter]: For program point L954-4(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:04,254 INFO L444 ceAbstractionStarter]: For program point L954-6(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:04,255 INFO L444 ceAbstractionStarter]: For program point L954-8(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:04,255 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,255 INFO L440 ceAbstractionStarter]: At program point L429(lines 352 433) the Hoare annotation is: (let ((.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse0 (not (= 1 ~pended~0))) (.cse1 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (= ~s~0 ~DC~0))) (or (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ULTIMATE.start_DiskPerfDeviceControl_~status~4) (= 0 |ULTIMATE.start_DiskPerfDeviceControl_#res|) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5) (and (<= (+ ULTIMATE.start_DiskPerfDeviceControl_~status~4 1073741789) 0) .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_DiskPerfDeviceControl_#res| 1073741789) 0) .cse4 .cse5) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse0 .cse1 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res|) .cse2 .cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse4 (= ~IPC~0 ~s~0)) (and .cse0 .cse1 .cse3 (<= (+ |ULTIMATE.start_DiskPerfDeviceControl_#res| 1073741823) 0) .cse4 .cse5))) [2019-11-24 04:32:04,255 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,255 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,255 INFO L447 ceAbstractionStarter]: At program point L829(lines 645 831) the Hoare annotation is: true [2019-11-24 04:32:04,255 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2019-11-24 04:32:04,255 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,255 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,256 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,256 INFO L440 ceAbstractionStarter]: At program point L705(lines 705 764) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,256 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 578) no Hoare annotation was computed. [2019-11-24 04:32:04,256 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,256 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,256 INFO L440 ceAbstractionStarter]: At program point L710(lines 710 763) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,256 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316-1(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316-2(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316-3(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316-4(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316-5(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316-6(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316-7(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,257 INFO L444 ceAbstractionStarter]: For program point L316-8(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L316-9(lines 316 318) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L977(lines 977 996) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L977-1(lines 977 996) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L977-2(lines 977 996) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L977-3(lines 977 996) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L977-4(lines 977 996) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L977-5(lines 977 996) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L978(lines 978 983) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L978-2(lines 978 983) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L978-4(lines 978 983) no Hoare annotation was computed. [2019-11-24 04:32:04,258 INFO L444 ceAbstractionStarter]: For program point L978-6(lines 978 983) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L978-8(lines 978 983) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L978-10(lines 978 983) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L54-1(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L54-2(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L54-3(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L54-4(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L54-5(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L54-6(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,259 INFO L444 ceAbstractionStarter]: For program point L54-7(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,260 INFO L444 ceAbstractionStarter]: For program point L54-8(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,260 INFO L444 ceAbstractionStarter]: For program point L54-9(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,260 INFO L444 ceAbstractionStarter]: For program point L54-10(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,260 INFO L440 ceAbstractionStarter]: At program point L715(lines 715 762) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,260 INFO L444 ceAbstractionStarter]: For program point L54-11(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,260 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,260 INFO L444 ceAbstractionStarter]: For program point L54-12(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,260 INFO L444 ceAbstractionStarter]: For program point L54-13(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,260 INFO L444 ceAbstractionStarter]: For program point L54-14(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-15(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-16(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-17(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-18(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-19(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-20(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-21(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-22(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,261 INFO L444 ceAbstractionStarter]: For program point L54-23(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L444 ceAbstractionStarter]: For program point L54-24(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L444 ceAbstractionStarter]: For program point L54-25(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L444 ceAbstractionStarter]: For program point L54-26(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L444 ceAbstractionStarter]: For program point L54-27(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L444 ceAbstractionStarter]: For program point L54-28(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L444 ceAbstractionStarter]: For program point L54-29(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L444 ceAbstractionStarter]: For program point L54-30(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L440 ceAbstractionStarter]: At program point L55(lines 950 963) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~s~0 ~DC~0)) [2019-11-24 04:32:04,262 INFO L444 ceAbstractionStarter]: For program point L54-31(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,262 INFO L440 ceAbstractionStarter]: At program point L55-1(lines 950 963) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0) (= ~s~0 ~DC~0)) [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-32(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,263 INFO L440 ceAbstractionStarter]: At program point L55-2(lines 950 963) the Hoare annotation is: (let ((.cse0 (not (= 1 ~pended~0))) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (= ~s~0 ~DC~0))) (or (and (<= (+ ULTIMATE.start_DiskPerfDeviceControl_~status~4 1073741789) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ULTIMATE.start_DiskPerfDeviceControl_~status~4) .cse0 .cse1 .cse2 .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5))) [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-33(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-34(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-35(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,263 INFO L440 ceAbstractionStarter]: At program point L55-5(lines 1 1098) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 0 ~routine~0) (= ~IPC~0 ~s~0)) [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-36(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-37(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-38(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-39(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,263 INFO L444 ceAbstractionStarter]: For program point L54-40(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L440 ceAbstractionStarter]: At program point L55-10(lines 1 1098) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse2 (= ~s~0 ~NP~0)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (not .cse2) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (or .cse2 (= ~MPR3~0 ~s~0)) (or .cse2 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:04,264 INFO L444 ceAbstractionStarter]: For program point L54-41(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L444 ceAbstractionStarter]: For program point L54-42(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L444 ceAbstractionStarter]: For program point L54-43(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L444 ceAbstractionStarter]: For program point L54-44(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L440 ceAbstractionStarter]: At program point L55-14(lines 1 1098) the Hoare annotation is: (let ((.cse22 (= ~s~0 ~NP~0)) (.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse23 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (= 0 ~routine~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse21 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (or (not .cse22) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse12 (or .cse22 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)))) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse23)) (.cse18 (or .cse22 (= ~MPR3~0 ~s~0))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse20 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2019-11-24 04:32:04,264 INFO L444 ceAbstractionStarter]: For program point L54-45(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L444 ceAbstractionStarter]: For program point L54-46(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L444 ceAbstractionStarter]: For program point L54-47(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L444 ceAbstractionStarter]: For program point L54-48(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,264 INFO L440 ceAbstractionStarter]: At program point L55-18(lines 1 1098) the Hoare annotation is: (let ((.cse22 (= ~s~0 ~NP~0)) (.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse23 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (= 0 ~routine~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse21 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (or (not .cse22) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse12 (or .cse22 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)))) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse23)) (.cse18 (or .cse22 (= ~MPR3~0 ~s~0))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse20 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2019-11-24 04:32:04,265 INFO L444 ceAbstractionStarter]: For program point L54-49(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,265 INFO L444 ceAbstractionStarter]: For program point L54-50(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,265 INFO L440 ceAbstractionStarter]: At program point L55-22(lines 1 1098) the Hoare annotation is: (let ((.cse22 (= ~s~0 ~NP~0)) (.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse23 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (= 0 ~routine~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse21 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (or (not .cse22) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse12 (or .cse22 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)))) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse23)) (.cse18 (or .cse22 (= ~MPR3~0 ~s~0))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse20 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2019-11-24 04:32:04,265 INFO L440 ceAbstractionStarter]: At program point L55-26(lines 1 1098) the Hoare annotation is: (let ((.cse22 (= ~s~0 ~NP~0)) (.cse21 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse23 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (= 0 ~routine~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse21 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (or (not .cse22) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse12 (or .cse22 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)))) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse23)) (.cse18 (or .cse22 (= ~MPR3~0 ~s~0))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse20 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2019-11-24 04:32:04,265 INFO L440 ceAbstractionStarter]: At program point L55-28(lines 950 963) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 ~routine~0)) (.cse7 (= ~s~0 ~DC~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse17 1) 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (not (= 1 ~pended~0))) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (<= 0 .cse18)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,265 INFO L440 ceAbstractionStarter]: At program point L55-33(lines 1 1098) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse2 (= ~s~0 ~NP~0)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (not .cse2) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= 0 .cse0) (or .cse2 (= ~MPR3~0 ~s~0)) (or .cse2 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:04,266 INFO L440 ceAbstractionStarter]: At program point L55-35(lines 950 963) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= 0 ~routine~0)) (.cse6 (= ~s~0 ~DC~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (not (= 1 ~pended~0))) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse4 .cse5 .cse6 .cse7 (= 0 ~customIrp~0) .cse8 (<= ~myStatus~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 0)) (let ((.cse16 (not (= ~s~0 ~NP~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) .cse9 (or .cse16 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse16 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258))))))) [2019-11-24 04:32:04,266 INFO L440 ceAbstractionStarter]: At program point L55-36(lines 1 1098) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:04,266 INFO L440 ceAbstractionStarter]: At program point L55-39(lines 1 1098) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,266 INFO L440 ceAbstractionStarter]: At program point L55-40(lines 1 1098) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:04,266 INFO L440 ceAbstractionStarter]: At program point L55-43(lines 1 1098) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (or (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= 0 (+ ULTIMATE.start_PoCallDriver_~returnVal~0 1073741823))) (and (= ~lowerDriverReturn~0 0) (= 0 ULTIMATE.start_PoCallDriver_~returnVal~0)) (and (= ~lowerDriverReturn~0 259) (= 259 ULTIMATE.start_PoCallDriver_~returnVal~0)))) [2019-11-24 04:32:04,266 INFO L440 ceAbstractionStarter]: At program point L55-46(lines 1 1098) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 0 ~routine~0) (= ~IPC~0 ~s~0)) [2019-11-24 04:32:04,266 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:32:04,266 INFO L440 ceAbstractionStarter]: At program point L720(lines 720 761) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,266 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,267 INFO L440 ceAbstractionStarter]: At program point L985(lines 977 996) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~s~0 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 0 ~routine~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)) (<= 0 .cse0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:04,267 INFO L440 ceAbstractionStarter]: At program point L985-1(lines 977 996) the Hoare annotation is: (let ((.cse3 (= ~s~0 ~NP~0)) (.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse21 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (= 0 ~routine~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse20 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (or (not .cse3) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse21)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse19 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2019-11-24 04:32:04,267 INFO L440 ceAbstractionStarter]: At program point L985-2(lines 977 996) the Hoare annotation is: (let ((.cse3 (= ~s~0 ~NP~0)) (.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse21 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse7 (= 0 ~routine~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse20 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (or (not .cse3) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse21)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse19 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2019-11-24 04:32:04,267 INFO L440 ceAbstractionStarter]: At program point L985-3(lines 977 996) the Hoare annotation is: (let ((.cse3 (= ~s~0 ~NP~0)) (.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse21 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse21 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse7 (= 0 ~routine~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse20 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (or (not .cse3) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= 0 .cse21)) (.cse18 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse19 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2019-11-24 04:32:04,268 INFO L440 ceAbstractionStarter]: At program point L985-4(lines 977 996) the Hoare annotation is: (let ((.cse3 (= ~s~0 ~NP~0)) (.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse20 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse20 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse19 1) 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (or (not .cse3) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse12 (not (= 1 ~pended~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse20)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494))) (.cse18 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 .cse8 .cse9 (<= ~myStatus~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2019-11-24 04:32:04,268 INFO L440 ceAbstractionStarter]: At program point L985-5(lines 977 996) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~s~0 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 0 ~routine~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)) (<= 0 .cse0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:04,268 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,268 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,268 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 200) no Hoare annotation was computed. [2019-11-24 04:32:04,268 INFO L440 ceAbstractionStarter]: At program point L725(lines 725 760) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,268 INFO L444 ceAbstractionStarter]: For program point L990(lines 990 994) no Hoare annotation was computed. [2019-11-24 04:32:04,268 INFO L440 ceAbstractionStarter]: At program point L990-1(lines 990 994) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~s~0 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (<= ~myStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (not (= 1 ~pended~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)))) [2019-11-24 04:32:04,268 INFO L444 ceAbstractionStarter]: For program point L990-2(lines 990 994) no Hoare annotation was computed. [2019-11-24 04:32:04,269 INFO L440 ceAbstractionStarter]: At program point L990-3(lines 990 994) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse19 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (not (= 1 ~pended~0))) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse19)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-24 04:32:04,269 INFO L444 ceAbstractionStarter]: For program point L990-4(lines 990 994) no Hoare annotation was computed. [2019-11-24 04:32:04,269 INFO L440 ceAbstractionStarter]: At program point L990-5(lines 990 994) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse19 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (not (= 1 ~pended~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse19)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-24 04:32:04,269 INFO L444 ceAbstractionStarter]: For program point L990-6(lines 990 994) no Hoare annotation was computed. [2019-11-24 04:32:04,269 INFO L440 ceAbstractionStarter]: At program point L990-7(lines 990 994) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse19 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse19 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse10 (<= ~myStatus~0 0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (not (= 1 ~pended~0))) (.cse13 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (<= 0 .cse19)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-24 04:32:04,269 INFO L444 ceAbstractionStarter]: For program point L990-8(lines 990 994) no Hoare annotation was computed. [2019-11-24 04:32:04,269 INFO L440 ceAbstractionStarter]: At program point L990-9(lines 990 994) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse17 1) 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (not (= 1 ~pended~0))) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (<= 0 .cse18)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse8 .cse9 (<= ~myStatus~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,269 INFO L444 ceAbstractionStarter]: For program point L990-10(lines 990 994) no Hoare annotation was computed. [2019-11-24 04:32:04,269 INFO L440 ceAbstractionStarter]: At program point L990-11(lines 990 994) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~s~0 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (<= ~myStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (not (= 1 ~pended~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)))) [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 597) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861-2(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861-4(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861-6(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861-8(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861-10(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861-12(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861-14(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,270 INFO L444 ceAbstractionStarter]: For program point L861-16(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L861-18(lines 861 867) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-1(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-3(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-5(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-7(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-9(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-11(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-13(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-15(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,271 INFO L444 ceAbstractionStarter]: For program point L334-17(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,272 INFO L444 ceAbstractionStarter]: For program point L334-19(lines 315 350) no Hoare annotation was computed. [2019-11-24 04:32:04,272 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,272 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,272 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,272 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 608) no Hoare annotation was computed. [2019-11-24 04:32:04,272 INFO L444 ceAbstractionStarter]: For program point L603-2(lines 524 622) no Hoare annotation was computed. [2019-11-24 04:32:04,272 INFO L440 ceAbstractionStarter]: At program point L339(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,272 INFO L440 ceAbstractionStarter]: At program point L339-1(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,272 INFO L440 ceAbstractionStarter]: At program point L339-2(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,273 INFO L440 ceAbstractionStarter]: At program point L339-3(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,273 INFO L440 ceAbstractionStarter]: At program point L339-4(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,273 INFO L440 ceAbstractionStarter]: At program point L339-5(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,273 INFO L440 ceAbstractionStarter]: At program point L339-6(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,273 INFO L440 ceAbstractionStarter]: At program point L339-7(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,273 INFO L440 ceAbstractionStarter]: At program point L339-8(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,273 INFO L440 ceAbstractionStarter]: At program point L339-9(lines 339 348) the Hoare annotation is: false [2019-11-24 04:32:04,273 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,273 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,273 INFO L444 ceAbstractionStarter]: For program point L340-2(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,273 INFO L444 ceAbstractionStarter]: For program point L340-4(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,273 INFO L444 ceAbstractionStarter]: For program point L340-6(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,273 INFO L444 ceAbstractionStarter]: For program point L340-8(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,273 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,273 INFO L444 ceAbstractionStarter]: For program point L340-10(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,274 INFO L444 ceAbstractionStarter]: For program point L340-12(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,274 INFO L444 ceAbstractionStarter]: For program point L340-14(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,274 INFO L444 ceAbstractionStarter]: For program point L340-16(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,274 INFO L444 ceAbstractionStarter]: For program point L340-18(lines 340 346) no Hoare annotation was computed. [2019-11-24 04:32:04,274 INFO L440 ceAbstractionStarter]: At program point L77(lines 681 770) the Hoare annotation is: (let ((.cse0 (not (= ~s~0 ~NP~0)))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~UNLOADED~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (or .cse0 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) (= 0 ~customIrp~0) (<= ~myStatus~0 0) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~MPR3~0 ~s~0)) (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse0 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)))) [2019-11-24 04:32:04,274 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,274 INFO L440 ceAbstractionStarter]: At program point L349(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,275 INFO L440 ceAbstractionStarter]: At program point L349-1(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,275 INFO L440 ceAbstractionStarter]: At program point L349-2(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,275 INFO L440 ceAbstractionStarter]: At program point L349-3(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,275 INFO L440 ceAbstractionStarter]: At program point L349-4(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,275 INFO L440 ceAbstractionStarter]: At program point L349-5(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,275 INFO L440 ceAbstractionStarter]: At program point L349-6(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,275 INFO L440 ceAbstractionStarter]: At program point L349-7(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,275 INFO L440 ceAbstractionStarter]: At program point L349-8(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,276 INFO L440 ceAbstractionStarter]: At program point L349-9(lines 298 351) the Hoare annotation is: false [2019-11-24 04:32:04,276 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 619) no Hoare annotation was computed. [2019-11-24 04:32:04,276 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,276 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:32:04,276 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,276 INFO L444 ceAbstractionStarter]: For program point L879(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,276 INFO L440 ceAbstractionStarter]: At program point L879-1(lines 879 897) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,276 INFO L444 ceAbstractionStarter]: For program point L879-2(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,277 INFO L440 ceAbstractionStarter]: At program point L879-3(lines 879 897) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~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))) [2019-11-24 04:32:04,277 INFO L444 ceAbstractionStarter]: For program point L879-4(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,277 INFO L440 ceAbstractionStarter]: At program point L879-5(lines 879 897) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= ~myStatus~0 0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~MPR1~0 ~s~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,277 INFO L444 ceAbstractionStarter]: For program point L879-6(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,277 INFO L440 ceAbstractionStarter]: At program point L879-7(lines 879 897) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= ~myStatus~0 0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~MPR1~0 ~s~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,277 INFO L444 ceAbstractionStarter]: For program point L879-8(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,278 INFO L440 ceAbstractionStarter]: At program point L615(lines 611 620) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= 0 ~routine~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse17 1) 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (not (= 1 ~pended~0))) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (<= 0 .cse18)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 (<= ~myStatus~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,278 INFO L440 ceAbstractionStarter]: At program point L879-9(lines 879 897) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= ~myStatus~0 0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~MPR1~0 ~s~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,278 INFO L444 ceAbstractionStarter]: For program point L879-10(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,278 INFO L440 ceAbstractionStarter]: At program point L879-11(lines 879 897) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse7 (<= (+ .cse17 1) 0)) (.cse8 (<= ~myStatus~0 0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~MPR1~0 ~s~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= 0 .cse18)) (.cse15 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494))) (.cse16 (= ~setEventCalled~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,278 INFO L444 ceAbstractionStarter]: For program point L879-12(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,279 INFO L440 ceAbstractionStarter]: At program point L879-13(lines 879 897) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse0 0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~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))) [2019-11-24 04:32:04,279 INFO L444 ceAbstractionStarter]: For program point L879-14(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,279 INFO L440 ceAbstractionStarter]: At program point L879-15(lines 879 897) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:04,279 INFO L444 ceAbstractionStarter]: For program point L879-16(lines 879 897) no Hoare annotation was computed. [2019-11-24 04:32:04,279 INFO L440 ceAbstractionStarter]: At program point L879-17(lines 879 897) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0)) [2019-11-24 04:32:04,279 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 225) no Hoare annotation was computed. [2019-11-24 04:32:04,279 INFO L440 ceAbstractionStarter]: At program point L880(lines 880 888) the Hoare annotation is: false [2019-11-24 04:32:04,280 INFO L444 ceAbstractionStarter]: For program point L880-2(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,280 INFO L440 ceAbstractionStarter]: At program point L880-3(lines 880 888) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,280 INFO L444 ceAbstractionStarter]: For program point L880-5(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,280 INFO L440 ceAbstractionStarter]: At program point L880-6(lines 880 888) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse2 (= ~s~0 ~NP~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= 0 ~routine~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= ~myStatus~0 0)) (.cse3 (not (= 1 ~pended~0))) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse5 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse3 .cse4 .cse6))) [2019-11-24 04:32:04,280 INFO L444 ceAbstractionStarter]: For program point L880-8(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,280 INFO L440 ceAbstractionStarter]: At program point L880-9(lines 880 888) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= 0 ~routine~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= ~myStatus~0 0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (not (= 1 ~pended~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse4 .cse5 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse2 .cse3 .cse6))) [2019-11-24 04:32:04,281 INFO L444 ceAbstractionStarter]: For program point L880-11(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,281 INFO L440 ceAbstractionStarter]: At program point L880-12(lines 880 888) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= 0 ~routine~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= ~myStatus~0 0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (not (= 1 ~pended~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse9 .cse10) (and .cse0 .cse1 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse4 .cse5 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse2 .cse3 .cse6))) [2019-11-24 04:32:04,281 INFO L444 ceAbstractionStarter]: For program point L880-14(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,281 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,281 INFO L440 ceAbstractionStarter]: At program point L880-15(lines 880 888) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= 0 ~routine~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= ~myStatus~0 0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (not (= 1 ~pended~0))) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse9 .cse10) (and .cse0 .cse1 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse4 .cse5 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse2 .cse3 .cse6))) [2019-11-24 04:32:04,281 INFO L444 ceAbstractionStarter]: For program point L880-17(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,282 INFO L440 ceAbstractionStarter]: At program point L880-18(lines 880 888) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= ~myStatus~0 0)) [2019-11-24 04:32:04,282 INFO L444 ceAbstractionStarter]: For program point L880-20(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,282 INFO L440 ceAbstractionStarter]: At program point L880-21(lines 880 888) the Hoare annotation is: false [2019-11-24 04:32:04,282 INFO L444 ceAbstractionStarter]: For program point L880-23(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,282 INFO L440 ceAbstractionStarter]: At program point L880-24(lines 880 888) the Hoare annotation is: false [2019-11-24 04:32:04,282 INFO L444 ceAbstractionStarter]: For program point L880-26(lines 880 888) no Hoare annotation was computed. [2019-11-24 04:32:04,282 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,283 INFO L440 ceAbstractionStarter]: At program point L758(lines 681 770) the Hoare annotation is: (let ((.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse14 (not (= 259 |ULTIMATE.start_DiskPerfDispatchPnp_#res|))) (.cse2 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (= 0 ~routine~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (not (= 259 ULTIMATE.start_DiskPerfDispatchPnp_~status~0))) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (not (= 1 ~pended~0))) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (not (= ULTIMATE.start_main_~status~6 259)))) (or (let ((.cse7 (not (= ~s~0 ~NP~0)))) (and (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258) (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2)) .cse6 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258)) (or .cse7 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse9 .cse10 (or (<= 260 ULTIMATE.start_main_~status~6) (<= ULTIMATE.start_main_~status~6 258)) (or (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3) .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258)))) (and .cse0 .cse9 .cse2 .cse10 .cse11 .cse4 .cse3 (or (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= 0 (+ ULTIMATE.start_PoCallDriver_~returnVal~0 1073741823))) (and (= ~lowerDriverReturn~0 0) (= 0 ULTIMATE.start_PoCallDriver_~returnVal~0)) (and (= ~lowerDriverReturn~0 259) (= 259 ULTIMATE.start_PoCallDriver_~returnVal~0))) .cse12) (and .cse9 (<= ULTIMATE.start_main_~status~6 0) .cse5) (and .cse0 .cse13 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse2 .cse1 .cse14 .cse4 .cse5 .cse3 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse6 .cse15 .cse8 .cse9 .cse10 .cse16) (and .cse6 .cse9 .cse2 .cse10 .cse1 .cse4 (= ~IPC~0 ~s~0) .cse12) (and .cse6 .cse0 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse9 .cse2 .cse1 .cse10 .cse11 .cse4 .cse3 .cse12) (and .cse0 .cse13 .cse14 .cse2 .cse1 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse4 .cse5 .cse3 .cse6 .cse15 .cse8 .cse9 .cse10 .cse16))) [2019-11-24 04:32:04,283 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,283 INFO L444 ceAbstractionStarter]: For program point L1023(lines 1023 1043) no Hoare annotation was computed. [2019-11-24 04:32:04,283 INFO L440 ceAbstractionStarter]: At program point L1023-1(lines 1023 1043) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~0) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:04,283 INFO L444 ceAbstractionStarter]: For program point L891(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,283 INFO L444 ceAbstractionStarter]: For program point L891-2(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,283 INFO L444 ceAbstractionStarter]: For program point L891-4(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,283 INFO L444 ceAbstractionStarter]: For program point L891-6(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,284 INFO L444 ceAbstractionStarter]: For program point L891-8(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,284 INFO L444 ceAbstractionStarter]: For program point L891-10(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,284 INFO L444 ceAbstractionStarter]: For program point L891-12(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,284 INFO L444 ceAbstractionStarter]: For program point L891-14(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,284 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,284 INFO L444 ceAbstractionStarter]: For program point L891-16(lines 891 895) no Hoare annotation was computed. [2019-11-24 04:32:04,284 INFO L440 ceAbstractionStarter]: At program point L1024(lines 1024 1034) the Hoare annotation is: false [2019-11-24 04:32:04,284 INFO L440 ceAbstractionStarter]: At program point L628(lines 459 630) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (<= .cse18 0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (not (= 259 ULTIMATE.start_DiskPerfStartDevice_~status~1))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (= 0 ~routine~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse17 1) 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (not (= 1 ~pended~0))) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (<= 0 .cse18)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 259)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) .cse8 .cse9 (<= ~myStatus~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2019-11-24 04:32:04,284 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,285 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-24 04:32:04,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:32:04 BoogieIcfgContainer [2019-11-24 04:32:04,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:32:04,429 INFO L168 Benchmark]: Toolchain (without parser) took 37249.78 ms. Allocated memory was 146.3 MB in the beginning and 652.2 MB in the end (delta: 505.9 MB). Free memory was 102.7 MB in the beginning and 503.6 MB in the end (delta: -400.8 MB). Peak memory consumption was 537.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:04,430 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 04:32:04,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.06 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 173.8 MB in the end (delta: -71.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:04,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.48 ms. Allocated memory is still 203.9 MB. Free memory was 173.8 MB in the beginning and 162.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:04,431 INFO L168 Benchmark]: Boogie Preprocessor took 108.09 ms. Allocated memory is still 203.9 MB. Free memory was 162.2 MB in the beginning and 155.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:04,431 INFO L168 Benchmark]: RCFGBuilder took 3160.74 ms. Allocated memory was 203.9 MB in the beginning and 250.1 MB in the end (delta: 46.1 MB). Free memory was 155.4 MB in the beginning and 137.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:04,432 INFO L168 Benchmark]: TraceAbstraction took 33215.03 ms. Allocated memory was 250.1 MB in the beginning and 652.2 MB in the end (delta: 402.1 MB). Free memory was 135.1 MB in the beginning and 503.6 MB in the end (delta: -368.4 MB). Peak memory consumption was 465.6 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:04,434 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.26 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 626.06 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 173.8 MB in the end (delta: -71.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 133.48 ms. Allocated memory is still 203.9 MB. Free memory was 173.8 MB in the beginning and 162.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.09 ms. Allocated memory is still 203.9 MB. Free memory was 162.2 MB in the beginning and 155.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3160.74 ms. Allocated memory was 203.9 MB in the beginning and 250.1 MB in the end (delta: 46.1 MB). Free memory was 155.4 MB in the beginning and 137.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33215.03 ms. Allocated memory was 250.1 MB in the beginning and 652.2 MB in the end (delta: 402.1 MB). Free memory was 135.1 MB in the beginning and 503.6 MB in the end (delta: -368.4 MB). Peak memory consumption was 465.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 51 specifications checked. All of them hold - InvariantResult [Line: 555]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 771]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((260 <= \result || \result <= 258) && NP + 2 <= SKIP1) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && (status <= 258 || 260 <= status)) && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && (260 <= status || status <= 258)) && ((260 <= status || !(s == NP)) || status <= 258)) || ((((((((NP + 2 <= SKIP1 && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == routine) && SKIP1 + 2 <= MPR1) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal))) && lowerDriverReturn == status)) || s == UNLOADED) || ((!(1 == pended) && status <= 0) && s == DC)) || (((((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && !(259 == \result)) && 0 == routine) && s == DC) && SKIP1 + 2 <= MPR1) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && !(status == 259))) || (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && 0 == routine) && IPC == s) && lowerDriverReturn == status)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == \result) && !(1 == pended)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == routine) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(259 == \result)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && 0 == routine) && s == DC) && SKIP1 + 2 <= MPR1) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && !(status == 259)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && 0 == routine) && IPC == s - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((260 <= \result || \result <= 258) && NP + 2 <= SKIP1) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && (status <= 258 || 260 <= status)) && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && (260 <= status || status <= 258)) && ((260 <= status || !(s == NP)) || status <= 258)) || ((((((((NP + 2 <= SKIP1 && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == routine) && SKIP1 + 2 <= MPR1) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal))) && lowerDriverReturn == status)) || s == UNLOADED) || ((!(1 == pended) && status <= 0) && s == DC)) || (((((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && !(259 == \result)) && 0 == routine) && s == DC) && SKIP1 + 2 <= MPR1) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && !(status == 259))) || (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && 0 == routine) && IPC == s) && lowerDriverReturn == status)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == \result) && !(1 == pended)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == routine) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(259 == \result)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && 0 == routine) && s == DC) && SKIP1 + 2 <= MPR1) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && !(status == 259)) - InvariantResult [Line: 720]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && !(1 == pended)) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((compRetStatus + 1073741802 <= 0 && (260 <= \result || \result <= 258)) && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && (status <= 258 || 260 <= status)) && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((260 <= status || !(s == NP)) || status <= 258)) || (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(259 == \result)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && !(259 == \result)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == \result) && !(1 == pended)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == routine)) || ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && status <= 0) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && \result <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && status <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && !(1 == pended)) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == routine - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: (((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 950]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && status <= 0) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && (status <= 258 || 260 <= status)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((260 <= status || !(s == NP)) || status <= 258)) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((260 <= \result || \result <= 258) && NP + 2 <= SKIP1) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && (status <= 258 || 260 <= status)) && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && (260 <= status || status <= 258)) && ((260 <= status || !(s == NP)) || status <= 258)) || ((((((((NP + 2 <= SKIP1 && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == routine) && SKIP1 + 2 <= MPR1) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal))) && lowerDriverReturn == status)) || ((!(1 == pended) && status <= 0) && s == DC)) || s == UNLOADED) || (((((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && !(259 == \result)) && 0 == routine) && s == DC) && SKIP1 + 2 <= MPR1) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && !(status == 259))) || (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && 0 == routine) && IPC == s) && lowerDriverReturn == status)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == \result) && !(1 == pended)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == routine) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(259 == \result)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && 0 == routine) && s == DC) && SKIP1 + 2 <= MPR1) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && !(status == 259)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && !(1 == pended)) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == routine) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal)) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine - InvariantResult [Line: 950]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: (((((((((status + 1073741789 <= 0 && status + 1073741789 <= 0) && (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && lowerDriverReturn == status) || ((((!(1 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC))) && \result + 1073741789 <= 0) || (DC + 2 <= s && ((((NP + 2 <= SKIP1 && (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && lowerDriverReturn == status) || ((((!(1 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC))) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) || ((((((((NP + 2 <= SKIP1 && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == routine) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal))) && lowerDriverReturn == status)))) || ((((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && lowerDriverReturn == status) || ((((!(1 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC)) && DC + 5 <= s)) || ((((((((returnVal2 <= lowerDriverReturn && !(259 == status)) && !(259 == status)) && NP + 5 <= MPR3) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && status <= 0) && ((((NP + 2 <= SKIP1 && (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && lowerDriverReturn == status) || ((((!(1 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC))) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) || ((((((((NP + 2 <= SKIP1 && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == routine) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal))) && lowerDriverReturn == status))) && !(status == 259))) || (((((((((returnVal2 <= lowerDriverReturn && !(259 == status)) && !(259 == status)) && !(status == 259)) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && !(259 == \result)) && ((((NP + 2 <= SKIP1 && (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && lowerDriverReturn == status) || ((((!(1 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC))) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) || ((((((((NP + 2 <= SKIP1 && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == routine) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal))) && lowerDriverReturn == status))) && status == __cil_tmp15) && !(status == 259))) || ((!(1 == pended) && status <= 0) && s == DC)) || (((((((((returnVal2 <= lowerDriverReturn && (260 <= status || status <= 258)) && (260 <= \result || \result <= 258)) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && (260 <= status || status <= 258)) && ((((NP + 2 <= SKIP1 && (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && lowerDriverReturn == status) || ((((!(1 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC))) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) || ((((((((NP + 2 <= SKIP1 && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == routine) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal))) && lowerDriverReturn == status))) && (status <= 258 || 260 <= status)) && ((260 <= status || !(s == NP)) || status <= 258))) || ((((((NP + 2 <= SKIP1 && 0 == status) && 0 == \result) && (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && lowerDriverReturn == status) || ((((!(1 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC))) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: (((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: (((((((((((((((((((((260 <= \result || \result <= 258) && NP + 2 <= SKIP1) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && (status <= 258 || 260 <= status)) && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && (260 <= status || status <= 258)) && ((260 <= status || !(s == NP)) || status <= 258)) || ((((((((NP + 2 <= SKIP1 && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == routine) && SKIP1 + 2 <= MPR1) && (((lowerDriverReturn + 1073741823 == 0 && 0 == returnVal + 1073741823) || (lowerDriverReturn == 0 && 0 == returnVal)) || (lowerDriverReturn == 259 && 259 == returnVal))) && lowerDriverReturn == status)) || ((!(1 == pended) && status <= 0) && s == DC)) || (((((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && !(259 == \result)) && 0 == routine) && s == DC) && SKIP1 + 2 <= MPR1) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && !(status == 259))) || (((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && 0 == routine) && IPC == s) && lowerDriverReturn == status)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == \result) && !(1 == pended)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == routine) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status)) || ((((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(259 == \result)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && 0 == routine) && s == DC) && SKIP1 + 2 <= MPR1) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && !(status == 259)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && status <= 0) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && (s == NP || 259 == returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && status <= 0) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 1022]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && 0 == routine) && NP + 2 <= s) && ((0 == returnVal || 259 == returnVal) || 0 == returnVal + 1073741823)) && SKIP1 == s - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 645]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 705]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && 0 == routine) && IPC == s - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && (status <= 258 || 260 <= status)) && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && ((260 <= status || !(s == NP)) || status <= 258))) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 <= lowerDriverReturn) && !(259 == status)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) && status <= 0) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && status <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && (s == NP || MPR3 == s)) && (s == NP || 259 == returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && !(1 == pended)) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1024]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (260 <= status || status <= 258)) && 0 <= compRetStatus + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 950]: Loop Invariant Derived loop invariant: ((((((status + 1073741789 <= 0 && !(1 == pended)) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) || ((((((((NP + 2 <= SKIP1 && 0 == status) && !(1 == pended)) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 771]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 524]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 950]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && 0 == routine) && s == DC - InvariantResult [Line: 950]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && s == DC - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && 0 == compRegistered) && SKIP2 + 3 <= IPC) && s == UNLOADED) && SKIP1 + 2 <= MPR1) && 0 == routine) && ((!(s == NP) || status <= 258) || 260 <= status)) && 0 == customIrp) && myStatus <= 0) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && !(MPR3 == s)) && ((260 <= status || !(s == NP)) || status <= 258) - InvariantResult [Line: 710]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && !(1 == pended)) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && s == NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status <= 0) && 1 <= compRegistered) && myStatus <= 0) || ((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && status == __cil_tmp15) && myStatus <= 0) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (260 <= status || status <= 258)) && 0 <= compRetStatus + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 == status) && 0 == \result) && !(1 == pended)) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && s == DC) || (((((((status + 1073741789 <= 0 && !(1 == pended)) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && \result + 1073741789 <= 0) && 0 == routine) && s == DC)) || ((((((((returnVal2 <= lowerDriverReturn && !(1 == pended)) && 0 == compRegistered) && lowerDriverReturn == \result) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && 0 == routine) && IPC == s)) || (((((!(1 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && \result + 1073741823 <= 0) && 0 == routine) && s == DC) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && status <= 0) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && s == NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status <= 0) && 1 <= compRegistered) && myStatus <= 0) || ((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && status == __cil_tmp15) && myStatus <= 0) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && status <= 0) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || (((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && status <= 0) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) || ((((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1) - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && !(259 == status)) && NP + 5 <= MPR3) && !(1 == pended)) && s == NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && status <= 0) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && myStatus <= 0) || ((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && status == __cil_tmp15) && myStatus <= 0) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && status <= 0) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (260 <= status || status <= 258)) && 0 <= compRetStatus + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 715]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && !(1 == pended)) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 0 == customIrp) && myStatus <= 0 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && status <= 0) && 0 == routine) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && !(259 == status)) && s == NP) && !(1 == pended)) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status <= 0) && 1 <= compRegistered) && myStatus <= 0) || ((((((((((((NP + 2 <= SKIP1 && !(259 == status)) && s == NP) && !(status == 259)) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && status == __cil_tmp15) && myStatus <= 0) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: (((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && 0 == customIrp) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status <= 0) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((compRetStatus + 1073741802 <= 0 && NP + 2 <= SKIP1) && !(259 == status)) && !(status == 259)) && s == NP) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status == __cil_tmp15) && myStatus <= 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 364 locations, 51 error locations. Result: SAFE, OverallTime: 33.0s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.2s, HoareTripleCheckerStatistics: 9999 SDtfs, 8435 SDslu, 13712 SDs, 0 SdLazy, 4506 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 40 MinimizatonAttempts, 1247 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 109 PreInvPairs, 274 NumberOfFragments, 11252 HoareAnnotationTreeSize, 109 FomulaSimplifications, 1327052 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 109 FomulaSimplificationsInter, 131495 FormulaSimplificationTreeSizeReductionInter, 18.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1048 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1008 ConstructedInterpolants, 0 QuantifiedInterpolants, 83012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 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...