/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/floppy_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:32:06,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:32:06,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:32:06,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:32:06,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:32:06,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:32:06,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:32:06,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:32:06,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:32:06,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:32:06,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:32:06,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:32:06,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:32:06,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:32:06,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:32:06,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:32:06,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:32:06,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:32:06,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:32:06,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:32:06,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:32:06,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:32:06,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:32:06,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:32:06,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:32:06,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:32:06,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:32:06,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:32:06,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:32:06,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:32:06,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:32:06,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:32:06,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:32:06,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:32:06,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:32:06,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:32:06,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:32:06,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:32:06,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:32:06,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:32:06,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:32:06,768 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:32:06,787 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:32:06,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:32:06,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:32:06,789 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:32:06,789 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:32:06,789 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:32:06,790 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:32:06,790 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:32:06,790 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:32:06,790 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:32:06,791 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:32:06,792 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:32:06,792 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:32:06,792 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:32:06,792 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:32:06,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:32:06,794 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:32:06,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:32:06,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:32:06,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:32:06,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:32:06,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:32:06,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:32:06,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:32:06,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:32:06,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:32:06,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:32:06,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:32:06,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:32:06,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:32:06,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:32:06,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:32:06,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:32:06,798 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:32:06,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:32:06,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:32:06,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:32:06,800 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:32:07,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:32:07,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:32:07,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:32:07,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:32:07,103 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:32:07,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-11-24 04:32:07,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79db04afe/cf6bb849741749a5b62b51ee89dc6fc1/FLAG3c6244ffd [2019-11-24 04:32:07,718 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:32:07,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-11-24 04:32:07,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79db04afe/cf6bb849741749a5b62b51ee89dc6fc1/FLAG3c6244ffd [2019-11-24 04:32:08,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79db04afe/cf6bb849741749a5b62b51ee89dc6fc1 [2019-11-24 04:32:08,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:32:08,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:32:08,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:32:08,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:32:08,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:32:08,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee1a95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08, skipping insertion in model container [2019-11-24 04:32:08,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:32:08,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:32:08,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:32:08,512 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:32:08,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:32:08,663 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:32:08,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08 WrapperNode [2019-11-24 04:32:08,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:32:08,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:32:08,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:32:08,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:32:08,670 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:32:08" (1/1) ... [2019-11-24 04:32:08,685 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:32:08" (1/1) ... [2019-11-24 04:32:08,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:32:08,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:32:08,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:32:08,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:32:08,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (1/1) ... [2019-11-24 04:32:08,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:32:08,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:32:08,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:32:08,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:32:08,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (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:32:08,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:32:08,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:32:09,224 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,232 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,239 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,242 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,244 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,248 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,252 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,256 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,257 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,258 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,263 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,267 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,268 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,269 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,271 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,274 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,279 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,283 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,285 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,289 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,292 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,294 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,295 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:09,297 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:10,370 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2019-11-24 04:32:10,371 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2019-11-24 04:32:10,371 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2019-11-24 04:32:10,372 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2019-11-24 04:32:10,372 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2019-11-24 04:32:10,372 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2019-11-24 04:32:10,373 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2019-11-24 04:32:10,373 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2019-11-24 04:32:10,374 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2019-11-24 04:32:10,374 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2019-11-24 04:32:10,374 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2019-11-24 04:32:10,374 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-24 04:32:10,374 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-24 04:32:10,375 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2019-11-24 04:32:10,375 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2019-11-24 04:32:10,375 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2019-11-24 04:32:10,375 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2019-11-24 04:32:10,376 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2019-11-24 04:32:10,376 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2019-11-24 04:32:10,376 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2019-11-24 04:32:10,376 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2019-11-24 04:32:10,376 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2019-11-24 04:32:10,377 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-24 04:32:10,377 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-24 04:32:10,378 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2019-11-24 04:32:10,378 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2019-11-24 04:32:10,378 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2019-11-24 04:32:10,378 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2019-11-24 04:32:10,378 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2019-11-24 04:32:10,379 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2019-11-24 04:32:10,379 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2019-11-24 04:32:10,379 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2019-11-24 04:32:10,379 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2019-11-24 04:32:10,380 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-11-24 04:32:10,380 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-11-24 04:32:10,381 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2019-11-24 04:32:10,381 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2019-11-24 04:32:10,381 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-11-24 04:32:10,381 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2019-11-24 04:32:10,382 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-11-24 04:32:10,382 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2019-11-24 04:32:10,382 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2019-11-24 04:32:10,382 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2019-11-24 04:32:10,382 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2019-11-24 04:32:10,383 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2019-11-24 04:32:10,383 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2019-11-24 04:32:10,383 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2019-11-24 04:32:10,383 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2019-11-24 04:32:11,289 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:32:11,289 INFO L284 CfgBuilder]: Removed 205 assume(true) statements. [2019-11-24 04:32:11,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:32:11 BoogieIcfgContainer [2019-11-24 04:32:11,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:32:11,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:32:11,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:32:11,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:32:11,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:32:08" (1/3) ... [2019-11-24 04:32:11,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541e9859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:32:11, skipping insertion in model container [2019-11-24 04:32:11,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:08" (2/3) ... [2019-11-24 04:32:11,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541e9859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:32:11, skipping insertion in model container [2019-11-24 04:32:11,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:32:11" (3/3) ... [2019-11-24 04:32:11,299 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-11-24 04:32:11,308 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:32:11,316 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 40 error locations. [2019-11-24 04:32:11,327 INFO L249 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2019-11-24 04:32:11,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:32:11,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:32:11,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:32:11,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:32:11,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:32:11,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:32:11,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:32:11,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:32:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-11-24 04:32:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:32:11,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:11,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:11,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1049040111, now seen corresponding path program 1 times [2019-11-24 04:32:11,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:11,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544153701] [2019-11-24 04:32:11,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:11,599 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:32:11,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544153701] [2019-11-24 04:32:11,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:11,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:11,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756425573] [2019-11-24 04:32:11,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:11,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:11,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:11,625 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2019-11-24 04:32:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:11,966 INFO L93 Difference]: Finished difference Result 480 states and 716 transitions. [2019-11-24 04:32:11,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:11,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 04:32:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:11,993 INFO L225 Difference]: With dead ends: 480 [2019-11-24 04:32:11,997 INFO L226 Difference]: Without dead ends: 256 [2019-11-24 04:32:12,006 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:32:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-24 04:32:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-11-24 04:32:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-24 04:32:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 340 transitions. [2019-11-24 04:32:12,116 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 340 transitions. Word has length 7 [2019-11-24 04:32:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:12,117 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 340 transitions. [2019-11-24 04:32:12,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 340 transitions. [2019-11-24 04:32:12,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:32:12,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:12,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:12,119 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1248421914, now seen corresponding path program 1 times [2019-11-24 04:32:12,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:12,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092651145] [2019-11-24 04:32:12,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:12,250 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:32:12,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092651145] [2019-11-24 04:32:12,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:12,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:12,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390566168] [2019-11-24 04:32:12,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:12,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:12,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:12,255 INFO L87 Difference]: Start difference. First operand 256 states and 340 transitions. Second operand 3 states. [2019-11-24 04:32:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:12,325 INFO L93 Difference]: Finished difference Result 472 states and 620 transitions. [2019-11-24 04:32:12,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:12,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:32:12,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:12,328 INFO L225 Difference]: With dead ends: 472 [2019-11-24 04:32:12,329 INFO L226 Difference]: Without dead ends: 330 [2019-11-24 04:32:12,330 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:32:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-24 04:32:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2019-11-24 04:32:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-24 04:32:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2019-11-24 04:32:12,349 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 9 [2019-11-24 04:32:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:12,349 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2019-11-24 04:32:12,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2019-11-24 04:32:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:32:12,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:12,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:12,351 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:12,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1214940225, now seen corresponding path program 1 times [2019-11-24 04:32:12,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:12,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701180207] [2019-11-24 04:32:12,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:12,379 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:32:12,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701180207] [2019-11-24 04:32:12,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:12,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:32:12,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881735114] [2019-11-24 04:32:12,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:12,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:12,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:12,382 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 3 states. [2019-11-24 04:32:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:12,402 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2019-11-24 04:32:12,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:12,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 04:32:12,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:12,404 INFO L225 Difference]: With dead ends: 263 [2019-11-24 04:32:12,404 INFO L226 Difference]: Without dead ends: 244 [2019-11-24 04:32:12,405 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:32:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-24 04:32:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2019-11-24 04:32:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-24 04:32:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 322 transitions. [2019-11-24 04:32:12,420 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 322 transitions. Word has length 10 [2019-11-24 04:32:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:12,420 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 322 transitions. [2019-11-24 04:32:12,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 322 transitions. [2019-11-24 04:32:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:32:12,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:12,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:12,422 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash -452514309, now seen corresponding path program 1 times [2019-11-24 04:32:12,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:12,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154476105] [2019-11-24 04:32:12,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:12,468 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:32:12,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154476105] [2019-11-24 04:32:12,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:12,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:12,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106424098] [2019-11-24 04:32:12,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:12,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:12,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:12,471 INFO L87 Difference]: Start difference. First operand 244 states and 322 transitions. Second operand 3 states. [2019-11-24 04:32:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:12,498 INFO L93 Difference]: Finished difference Result 301 states and 390 transitions. [2019-11-24 04:32:12,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:12,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:32:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:12,500 INFO L225 Difference]: With dead ends: 301 [2019-11-24 04:32:12,500 INFO L226 Difference]: Without dead ends: 281 [2019-11-24 04:32:12,501 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:32:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-24 04:32:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2019-11-24 04:32:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-24 04:32:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 348 transitions. [2019-11-24 04:32:12,517 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 348 transitions. Word has length 13 [2019-11-24 04:32:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:12,517 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 348 transitions. [2019-11-24 04:32:12,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 348 transitions. [2019-11-24 04:32:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:32:12,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:12,524 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:32:12,524 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:12,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash -314161949, now seen corresponding path program 1 times [2019-11-24 04:32:12,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:12,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785311072] [2019-11-24 04:32:12,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:12,594 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:32:12,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785311072] [2019-11-24 04:32:12,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:12,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:12,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033466519] [2019-11-24 04:32:12,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:12,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:12,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:12,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:12,596 INFO L87 Difference]: Start difference. First operand 262 states and 348 transitions. Second operand 3 states. [2019-11-24 04:32:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:12,780 INFO L93 Difference]: Finished difference Result 335 states and 441 transitions. [2019-11-24 04:32:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:12,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 04:32:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:12,783 INFO L225 Difference]: With dead ends: 335 [2019-11-24 04:32:12,783 INFO L226 Difference]: Without dead ends: 327 [2019-11-24 04:32:12,784 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:32:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-24 04:32:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 274. [2019-11-24 04:32:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-24 04:32:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 366 transitions. [2019-11-24 04:32:12,798 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 366 transitions. Word has length 16 [2019-11-24 04:32:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:12,799 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 366 transitions. [2019-11-24 04:32:12,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 366 transitions. [2019-11-24 04:32:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:32:12,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:12,800 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:32:12,801 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:12,801 INFO L82 PathProgramCache]: Analyzing trace with hash -836310948, now seen corresponding path program 1 times [2019-11-24 04:32:12,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:12,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046513711] [2019-11-24 04:32:12,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:12,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046513711] [2019-11-24 04:32:12,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:12,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:12,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029643183] [2019-11-24 04:32:12,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:12,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:12,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:12,843 INFO L87 Difference]: Start difference. First operand 274 states and 366 transitions. Second operand 3 states. [2019-11-24 04:32:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:13,011 INFO L93 Difference]: Finished difference Result 296 states and 392 transitions. [2019-11-24 04:32:13,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:13,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 04:32:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:13,014 INFO L225 Difference]: With dead ends: 296 [2019-11-24 04:32:13,014 INFO L226 Difference]: Without dead ends: 291 [2019-11-24 04:32:13,014 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:32:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-24 04:32:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-11-24 04:32:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-24 04:32:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2019-11-24 04:32:13,028 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 387 transitions. Word has length 16 [2019-11-24 04:32:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:13,028 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 387 transitions. [2019-11-24 04:32:13,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 387 transitions. [2019-11-24 04:32:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:32:13,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:13,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:13,030 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1776532247, now seen corresponding path program 1 times [2019-11-24 04:32:13,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:13,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091335517] [2019-11-24 04:32:13,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:13,081 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:32:13,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091335517] [2019-11-24 04:32:13,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:13,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:13,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493631301] [2019-11-24 04:32:13,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:13,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:13,084 INFO L87 Difference]: Start difference. First operand 291 states and 387 transitions. Second operand 3 states. [2019-11-24 04:32:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:13,213 INFO L93 Difference]: Finished difference Result 397 states and 529 transitions. [2019-11-24 04:32:13,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:13,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:32:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:13,216 INFO L225 Difference]: With dead ends: 397 [2019-11-24 04:32:13,216 INFO L226 Difference]: Without dead ends: 288 [2019-11-24 04:32:13,218 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:32:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-24 04:32:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-11-24 04:32:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-24 04:32:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 383 transitions. [2019-11-24 04:32:13,233 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 383 transitions. Word has length 17 [2019-11-24 04:32:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:13,234 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 383 transitions. [2019-11-24 04:32:13,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 383 transitions. [2019-11-24 04:32:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:32:13,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:13,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:13,235 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:13,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1156744329, now seen corresponding path program 1 times [2019-11-24 04:32:13,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:13,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662772407] [2019-11-24 04:32:13,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:13,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:32:13,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662772407] [2019-11-24 04:32:13,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:13,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:13,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130728100] [2019-11-24 04:32:13,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:32:13,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:13,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:32:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:32:13,315 INFO L87 Difference]: Start difference. First operand 288 states and 383 transitions. Second operand 7 states. [2019-11-24 04:32:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:13,747 INFO L93 Difference]: Finished difference Result 343 states and 449 transitions. [2019-11-24 04:32:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:13,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-24 04:32:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:13,750 INFO L225 Difference]: With dead ends: 343 [2019-11-24 04:32:13,750 INFO L226 Difference]: Without dead ends: 288 [2019-11-24 04:32:13,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:32:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-24 04:32:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2019-11-24 04:32:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-24 04:32:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 368 transitions. [2019-11-24 04:32:13,772 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 368 transitions. Word has length 17 [2019-11-24 04:32:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:13,772 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 368 transitions. [2019-11-24 04:32:13,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:32:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 368 transitions. [2019-11-24 04:32:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:32:13,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:13,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:13,774 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1781970427, now seen corresponding path program 1 times [2019-11-24 04:32:13,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:13,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795624092] [2019-11-24 04:32:13,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:13,823 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:32:13,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795624092] [2019-11-24 04:32:13,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:13,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:13,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452286394] [2019-11-24 04:32:13,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:13,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:13,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:13,826 INFO L87 Difference]: Start difference. First operand 280 states and 368 transitions. Second operand 3 states. [2019-11-24 04:32:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:13,966 INFO L93 Difference]: Finished difference Result 280 states and 368 transitions. [2019-11-24 04:32:13,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:13,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:32:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:13,969 INFO L225 Difference]: With dead ends: 280 [2019-11-24 04:32:13,969 INFO L226 Difference]: Without dead ends: 268 [2019-11-24 04:32:13,970 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:32:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-24 04:32:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-11-24 04:32:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-24 04:32:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2019-11-24 04:32:13,988 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 17 [2019-11-24 04:32:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:13,989 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2019-11-24 04:32:13,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2019-11-24 04:32:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:32:13,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:13,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:13,991 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:13,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:13,991 INFO L82 PathProgramCache]: Analyzing trace with hash -138379543, now seen corresponding path program 1 times [2019-11-24 04:32:13,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:13,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215598017] [2019-11-24 04:32:13,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:14,027 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:32:14,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215598017] [2019-11-24 04:32:14,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:14,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:14,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794492249] [2019-11-24 04:32:14,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:14,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:14,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:14,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:14,030 INFO L87 Difference]: Start difference. First operand 268 states and 355 transitions. Second operand 4 states. [2019-11-24 04:32:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:14,096 INFO L93 Difference]: Finished difference Result 281 states and 369 transitions. [2019-11-24 04:32:14,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:14,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:32:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:14,098 INFO L225 Difference]: With dead ends: 281 [2019-11-24 04:32:14,098 INFO L226 Difference]: Without dead ends: 266 [2019-11-24 04:32:14,098 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:32:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-24 04:32:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-24 04:32:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-24 04:32:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2019-11-24 04:32:14,112 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 17 [2019-11-24 04:32:14,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:14,113 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2019-11-24 04:32:14,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2019-11-24 04:32:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:32:14,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:14,114 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:32:14,114 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash -860989659, now seen corresponding path program 1 times [2019-11-24 04:32:14,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:14,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118199694] [2019-11-24 04:32:14,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:14,138 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:32:14,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118199694] [2019-11-24 04:32:14,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:14,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:14,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976908163] [2019-11-24 04:32:14,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:14,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:14,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:14,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:14,141 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand 3 states. [2019-11-24 04:32:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:14,172 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions. [2019-11-24 04:32:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:14,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:32:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:14,174 INFO L225 Difference]: With dead ends: 363 [2019-11-24 04:32:14,175 INFO L226 Difference]: Without dead ends: 262 [2019-11-24 04:32:14,175 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:32:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-24 04:32:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 248. [2019-11-24 04:32:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-24 04:32:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2019-11-24 04:32:14,189 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 19 [2019-11-24 04:32:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:14,189 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2019-11-24 04:32:14,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2019-11-24 04:32:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:32:14,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:14,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] [2019-11-24 04:32:14,191 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash -577385694, now seen corresponding path program 1 times [2019-11-24 04:32:14,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:14,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610494705] [2019-11-24 04:32:14,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:14,233 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:32:14,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610494705] [2019-11-24 04:32:14,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:14,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:14,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105864415] [2019-11-24 04:32:14,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:14,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:14,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:14,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:14,237 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand 3 states. [2019-11-24 04:32:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:14,272 INFO L93 Difference]: Finished difference Result 365 states and 468 transitions. [2019-11-24 04:32:14,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:14,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:32:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:14,274 INFO L225 Difference]: With dead ends: 365 [2019-11-24 04:32:14,274 INFO L226 Difference]: Without dead ends: 271 [2019-11-24 04:32:14,275 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:32:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-24 04:32:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 236. [2019-11-24 04:32:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-24 04:32:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2019-11-24 04:32:14,291 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 20 [2019-11-24 04:32:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:14,292 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2019-11-24 04:32:14,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2019-11-24 04:32:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:32:14,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:14,293 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:32:14,293 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:14,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:14,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1425584408, now seen corresponding path program 1 times [2019-11-24 04:32:14,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:14,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373511435] [2019-11-24 04:32:14,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:14,466 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:32:14,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373511435] [2019-11-24 04:32:14,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:14,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:14,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028262131] [2019-11-24 04:32:14,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:14,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:14,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:14,470 INFO L87 Difference]: Start difference. First operand 236 states and 304 transitions. Second operand 3 states. [2019-11-24 04:32:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:14,516 INFO L93 Difference]: Finished difference Result 336 states and 430 transitions. [2019-11-24 04:32:14,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:14,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:32:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:14,518 INFO L225 Difference]: With dead ends: 336 [2019-11-24 04:32:14,518 INFO L226 Difference]: Without dead ends: 238 [2019-11-24 04:32:14,518 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:32:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-24 04:32:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 224. [2019-11-24 04:32:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-24 04:32:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2019-11-24 04:32:14,535 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 21 [2019-11-24 04:32:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:14,535 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2019-11-24 04:32:14,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2019-11-24 04:32:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:32:14,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:14,536 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:32:14,537 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash 562843807, now seen corresponding path program 1 times [2019-11-24 04:32:14,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:14,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930948996] [2019-11-24 04:32:14,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:14,595 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:32:14,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930948996] [2019-11-24 04:32:14,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:14,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:14,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040921187] [2019-11-24 04:32:14,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:14,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:14,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:14,598 INFO L87 Difference]: Start difference. First operand 224 states and 286 transitions. Second operand 4 states. [2019-11-24 04:32:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:14,738 INFO L93 Difference]: Finished difference Result 310 states and 395 transitions. [2019-11-24 04:32:14,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:14,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-24 04:32:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:14,740 INFO L225 Difference]: With dead ends: 310 [2019-11-24 04:32:14,740 INFO L226 Difference]: Without dead ends: 224 [2019-11-24 04:32:14,740 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:32:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-24 04:32:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-11-24 04:32:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-24 04:32:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 283 transitions. [2019-11-24 04:32:14,757 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 283 transitions. Word has length 22 [2019-11-24 04:32:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:14,758 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 283 transitions. [2019-11-24 04:32:14,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 283 transitions. [2019-11-24 04:32:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:32:14,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:14,760 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:32:14,760 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2122628294, now seen corresponding path program 1 times [2019-11-24 04:32:14,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:14,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335700477] [2019-11-24 04:32:14,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:14,860 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:32:14,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335700477] [2019-11-24 04:32:14,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:14,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:14,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214660563] [2019-11-24 04:32:14,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:14,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:14,864 INFO L87 Difference]: Start difference. First operand 224 states and 283 transitions. Second operand 5 states. [2019-11-24 04:32:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:15,195 INFO L93 Difference]: Finished difference Result 291 states and 364 transitions. [2019-11-24 04:32:15,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:15,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:32:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:15,197 INFO L225 Difference]: With dead ends: 291 [2019-11-24 04:32:15,197 INFO L226 Difference]: Without dead ends: 287 [2019-11-24 04:32:15,198 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:32:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-24 04:32:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 224. [2019-11-24 04:32:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-24 04:32:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 283 transitions. [2019-11-24 04:32:15,215 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 283 transitions. Word has length 23 [2019-11-24 04:32:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:15,216 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 283 transitions. [2019-11-24 04:32:15,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 283 transitions. [2019-11-24 04:32:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:32:15,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:15,217 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:32:15,217 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1926038797, now seen corresponding path program 1 times [2019-11-24 04:32:15,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:15,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165124407] [2019-11-24 04:32:15,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:15,267 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:32:15,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165124407] [2019-11-24 04:32:15,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:15,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:15,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332399296] [2019-11-24 04:32:15,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:15,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:15,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:15,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:15,270 INFO L87 Difference]: Start difference. First operand 224 states and 283 transitions. Second operand 5 states. [2019-11-24 04:32:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:15,344 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2019-11-24 04:32:15,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:15,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 04:32:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:15,347 INFO L225 Difference]: With dead ends: 238 [2019-11-24 04:32:15,347 INFO L226 Difference]: Without dead ends: 216 [2019-11-24 04:32:15,347 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:32:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-24 04:32:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-24 04:32:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-24 04:32:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 271 transitions. [2019-11-24 04:32:15,365 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 271 transitions. Word has length 24 [2019-11-24 04:32:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:15,366 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 271 transitions. [2019-11-24 04:32:15,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 271 transitions. [2019-11-24 04:32:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:32:15,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:15,368 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:32:15,368 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:15,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1277371961, now seen corresponding path program 1 times [2019-11-24 04:32:15,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:15,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125356349] [2019-11-24 04:32:15,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:15,408 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:32:15,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125356349] [2019-11-24 04:32:15,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:15,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:15,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296288441] [2019-11-24 04:32:15,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:15,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:15,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:15,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:15,410 INFO L87 Difference]: Start difference. First operand 216 states and 271 transitions. Second operand 3 states. [2019-11-24 04:32:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:15,521 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2019-11-24 04:32:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:15,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:32:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:15,523 INFO L225 Difference]: With dead ends: 255 [2019-11-24 04:32:15,523 INFO L226 Difference]: Without dead ends: 247 [2019-11-24 04:32:15,523 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:32:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-24 04:32:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 237. [2019-11-24 04:32:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-24 04:32:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 295 transitions. [2019-11-24 04:32:15,542 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 295 transitions. Word has length 24 [2019-11-24 04:32:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:15,542 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 295 transitions. [2019-11-24 04:32:15,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 295 transitions. [2019-11-24 04:32:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:32:15,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:15,543 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:32:15,544 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:15,544 INFO L82 PathProgramCache]: Analyzing trace with hash 961293112, now seen corresponding path program 1 times [2019-11-24 04:32:15,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:15,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448157686] [2019-11-24 04:32:15,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:15,592 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:32:15,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448157686] [2019-11-24 04:32:15,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:15,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:15,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264534332] [2019-11-24 04:32:15,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:15,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:15,595 INFO L87 Difference]: Start difference. First operand 237 states and 295 transitions. Second operand 5 states. [2019-11-24 04:32:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:15,818 INFO L93 Difference]: Finished difference Result 253 states and 309 transitions. [2019-11-24 04:32:15,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:15,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 04:32:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:15,820 INFO L225 Difference]: With dead ends: 253 [2019-11-24 04:32:15,820 INFO L226 Difference]: Without dead ends: 245 [2019-11-24 04:32:15,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:32:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-24 04:32:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 237. [2019-11-24 04:32:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-24 04:32:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 294 transitions. [2019-11-24 04:32:15,842 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 294 transitions. Word has length 25 [2019-11-24 04:32:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:15,842 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 294 transitions. [2019-11-24 04:32:15,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 294 transitions. [2019-11-24 04:32:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:32:15,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:15,844 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:32:15,844 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -58105058, now seen corresponding path program 1 times [2019-11-24 04:32:15,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:15,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332609235] [2019-11-24 04:32:15,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:15,913 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:32:15,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332609235] [2019-11-24 04:32:15,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:15,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:15,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182589190] [2019-11-24 04:32:15,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:15,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:15,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:15,916 INFO L87 Difference]: Start difference. First operand 237 states and 294 transitions. Second operand 4 states. [2019-11-24 04:32:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:16,077 INFO L93 Difference]: Finished difference Result 271 states and 331 transitions. [2019-11-24 04:32:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:16,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-24 04:32:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:16,080 INFO L225 Difference]: With dead ends: 271 [2019-11-24 04:32:16,080 INFO L226 Difference]: Without dead ends: 237 [2019-11-24 04:32:16,080 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:32:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-24 04:32:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-24 04:32:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-24 04:32:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 287 transitions. [2019-11-24 04:32:16,113 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 287 transitions. Word has length 25 [2019-11-24 04:32:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:16,113 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 287 transitions. [2019-11-24 04:32:16,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 287 transitions. [2019-11-24 04:32:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:32:16,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:16,114 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:32:16,115 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash -110094717, now seen corresponding path program 1 times [2019-11-24 04:32:16,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:16,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312902507] [2019-11-24 04:32:16,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:16,179 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:32:16,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312902507] [2019-11-24 04:32:16,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:16,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:16,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859559404] [2019-11-24 04:32:16,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:16,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:16,182 INFO L87 Difference]: Start difference. First operand 237 states and 287 transitions. Second operand 5 states. [2019-11-24 04:32:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:16,460 INFO L93 Difference]: Finished difference Result 257 states and 313 transitions. [2019-11-24 04:32:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:16,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 04:32:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:16,462 INFO L225 Difference]: With dead ends: 257 [2019-11-24 04:32:16,462 INFO L226 Difference]: Without dead ends: 255 [2019-11-24 04:32:16,462 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:32:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-24 04:32:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 237. [2019-11-24 04:32:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-24 04:32:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 287 transitions. [2019-11-24 04:32:16,487 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 287 transitions. Word has length 25 [2019-11-24 04:32:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:16,489 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 287 transitions. [2019-11-24 04:32:16,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 287 transitions. [2019-11-24 04:32:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:32:16,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:16,491 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] [2019-11-24 04:32:16,491 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash -794310412, now seen corresponding path program 1 times [2019-11-24 04:32:16,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:16,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328838727] [2019-11-24 04:32:16,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:16,541 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:32:16,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328838727] [2019-11-24 04:32:16,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:16,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:16,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099555997] [2019-11-24 04:32:16,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:16,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:16,543 INFO L87 Difference]: Start difference. First operand 237 states and 287 transitions. Second operand 4 states. [2019-11-24 04:32:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:16,679 INFO L93 Difference]: Finished difference Result 245 states and 294 transitions. [2019-11-24 04:32:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:16,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 04:32:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:16,681 INFO L225 Difference]: With dead ends: 245 [2019-11-24 04:32:16,681 INFO L226 Difference]: Without dead ends: 216 [2019-11-24 04:32:16,681 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:32:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-24 04:32:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-24 04:32:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-24 04:32:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 257 transitions. [2019-11-24 04:32:16,700 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 257 transitions. Word has length 26 [2019-11-24 04:32:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:16,700 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 257 transitions. [2019-11-24 04:32:16,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 257 transitions. [2019-11-24 04:32:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:32:16,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:16,702 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] [2019-11-24 04:32:16,702 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:16,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1698630850, now seen corresponding path program 1 times [2019-11-24 04:32:16,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:16,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268810017] [2019-11-24 04:32:16,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:16,728 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:32:16,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268810017] [2019-11-24 04:32:16,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:16,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:16,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125975007] [2019-11-24 04:32:16,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:16,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:16,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:16,731 INFO L87 Difference]: Start difference. First operand 216 states and 257 transitions. Second operand 3 states. [2019-11-24 04:32:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:16,820 INFO L93 Difference]: Finished difference Result 231 states and 270 transitions. [2019-11-24 04:32:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:16,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 04:32:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:16,823 INFO L225 Difference]: With dead ends: 231 [2019-11-24 04:32:16,824 INFO L226 Difference]: Without dead ends: 217 [2019-11-24 04:32:16,824 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:32:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-24 04:32:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2019-11-24 04:32:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-24 04:32:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 251 transitions. [2019-11-24 04:32:16,843 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 251 transitions. Word has length 26 [2019-11-24 04:32:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:16,843 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 251 transitions. [2019-11-24 04:32:16,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 251 transitions. [2019-11-24 04:32:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:32:16,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:16,844 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:32:16,845 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:16,845 INFO L82 PathProgramCache]: Analyzing trace with hash -943840679, now seen corresponding path program 1 times [2019-11-24 04:32:16,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:16,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968243087] [2019-11-24 04:32:16,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:16,897 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:32:16,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968243087] [2019-11-24 04:32:16,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:16,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:16,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637031848] [2019-11-24 04:32:16,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:16,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:16,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:16,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:16,899 INFO L87 Difference]: Start difference. First operand 212 states and 251 transitions. Second operand 4 states. [2019-11-24 04:32:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:17,007 INFO L93 Difference]: Finished difference Result 244 states and 294 transitions. [2019-11-24 04:32:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:17,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-24 04:32:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:17,009 INFO L225 Difference]: With dead ends: 244 [2019-11-24 04:32:17,009 INFO L226 Difference]: Without dead ends: 238 [2019-11-24 04:32:17,010 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:32:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-24 04:32:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2019-11-24 04:32:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-24 04:32:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2019-11-24 04:32:17,027 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 27 [2019-11-24 04:32:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:17,027 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2019-11-24 04:32:17,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2019-11-24 04:32:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:32:17,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:17,028 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:32:17,028 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:17,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1100480813, now seen corresponding path program 1 times [2019-11-24 04:32:17,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:17,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538045079] [2019-11-24 04:32:17,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:17,100 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:32:17,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538045079] [2019-11-24 04:32:17,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:17,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:17,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890377942] [2019-11-24 04:32:17,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:17,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:17,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:17,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:17,102 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand 5 states. [2019-11-24 04:32:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:17,271 INFO L93 Difference]: Finished difference Result 212 states and 249 transitions. [2019-11-24 04:32:17,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:17,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-24 04:32:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:17,273 INFO L225 Difference]: With dead ends: 212 [2019-11-24 04:32:17,273 INFO L226 Difference]: Without dead ends: 209 [2019-11-24 04:32:17,274 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:32:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-24 04:32:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2019-11-24 04:32:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-24 04:32:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 242 transitions. [2019-11-24 04:32:17,298 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 242 transitions. Word has length 27 [2019-11-24 04:32:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:17,298 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 242 transitions. [2019-11-24 04:32:17,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 242 transitions. [2019-11-24 04:32:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:32:17,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:17,299 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:32:17,299 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1100492729, now seen corresponding path program 1 times [2019-11-24 04:32:17,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:17,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315441401] [2019-11-24 04:32:17,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:17,348 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:32:17,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315441401] [2019-11-24 04:32:17,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:17,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:17,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98177652] [2019-11-24 04:32:17,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:17,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:17,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:17,350 INFO L87 Difference]: Start difference. First operand 204 states and 242 transitions. Second operand 5 states. [2019-11-24 04:32:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:17,490 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2019-11-24 04:32:17,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:17,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-24 04:32:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:17,492 INFO L225 Difference]: With dead ends: 209 [2019-11-24 04:32:17,492 INFO L226 Difference]: Without dead ends: 190 [2019-11-24 04:32:17,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-24 04:32:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-24 04:32:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-24 04:32:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2019-11-24 04:32:17,509 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 27 [2019-11-24 04:32:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:17,509 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2019-11-24 04:32:17,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2019-11-24 04:32:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:32:17,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:17,510 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] [2019-11-24 04:32:17,510 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1606658885, now seen corresponding path program 1 times [2019-11-24 04:32:17,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:17,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281539957] [2019-11-24 04:32:17,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:17,582 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:32:17,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281539957] [2019-11-24 04:32:17,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:17,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:17,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497986923] [2019-11-24 04:32:17,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:17,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:17,584 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand 6 states. [2019-11-24 04:32:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:17,753 INFO L93 Difference]: Finished difference Result 206 states and 241 transitions. [2019-11-24 04:32:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:17,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-24 04:32:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:17,754 INFO L225 Difference]: With dead ends: 206 [2019-11-24 04:32:17,754 INFO L226 Difference]: Without dead ends: 118 [2019-11-24 04:32:17,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:32:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-24 04:32:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2019-11-24 04:32:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-24 04:32:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2019-11-24 04:32:17,766 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 30 [2019-11-24 04:32:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:17,766 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2019-11-24 04:32:17,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2019-11-24 04:32:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 04:32:17,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:17,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:17,768 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:17,768 INFO L82 PathProgramCache]: Analyzing trace with hash 244598605, now seen corresponding path program 1 times [2019-11-24 04:32:17,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:17,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490483237] [2019-11-24 04:32:17,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:17,846 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:32:17,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490483237] [2019-11-24 04:32:17,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:17,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:32:17,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093863575] [2019-11-24 04:32:17,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:32:17,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:32:17,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:32:17,849 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 7 states. [2019-11-24 04:32:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,105 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2019-11-24 04:32:18,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:32:18,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-24 04:32:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,107 INFO L225 Difference]: With dead ends: 141 [2019-11-24 04:32:18,107 INFO L226 Difference]: Without dead ends: 139 [2019-11-24 04:32:18,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:32:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-24 04:32:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 102. [2019-11-24 04:32:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-24 04:32:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2019-11-24 04:32:18,118 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 33 [2019-11-24 04:32:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:18,118 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2019-11-24 04:32:18,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:32:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2019-11-24 04:32:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:32:18,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:18,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:18,119 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:18,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash 230228966, now seen corresponding path program 1 times [2019-11-24 04:32:18,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:18,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153167349] [2019-11-24 04:32:18,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,215 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:32:18,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153167349] [2019-11-24 04:32:18,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:32:18,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704111264] [2019-11-24 04:32:18,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 04:32:18,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 04:32:18,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:32:18,217 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 10 states. [2019-11-24 04:32:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,611 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2019-11-24 04:32:18,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:32:18,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-24 04:32:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,613 INFO L225 Difference]: With dead ends: 153 [2019-11-24 04:32:18,613 INFO L226 Difference]: Without dead ends: 148 [2019-11-24 04:32:18,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-24 04:32:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-24 04:32:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 121. [2019-11-24 04:32:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-24 04:32:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-11-24 04:32:18,655 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 36 [2019-11-24 04:32:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:18,655 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-11-24 04:32:18,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 04:32:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-11-24 04:32:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:32:18,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:18,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:18,656 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:18,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1916495717, now seen corresponding path program 1 times [2019-11-24 04:32:18,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:18,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437138128] [2019-11-24 04:32:18,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,738 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:32:18,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437138128] [2019-11-24 04:32:18,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:18,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181264696] [2019-11-24 04:32:18,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:18,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:18,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:18,739 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 5 states. [2019-11-24 04:32:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,863 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-11-24 04:32:18,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:18,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-11-24 04:32:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,865 INFO L225 Difference]: With dead ends: 159 [2019-11-24 04:32:18,865 INFO L226 Difference]: Without dead ends: 157 [2019-11-24 04:32:18,865 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:32:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-24 04:32:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2019-11-24 04:32:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-24 04:32:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2019-11-24 04:32:18,879 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 36 [2019-11-24 04:32:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:18,880 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2019-11-24 04:32:18,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2019-11-24 04:32:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:32:18,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:18,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:18,881 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:18,881 INFO L82 PathProgramCache]: Analyzing trace with hash 40219240, now seen corresponding path program 1 times [2019-11-24 04:32:18,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:18,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204712611] [2019-11-24 04:32:18,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,927 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:32:18,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204712611] [2019-11-24 04:32:18,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:18,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879632920] [2019-11-24 04:32:18,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:18,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:18,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:18,931 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand 4 states. [2019-11-24 04:32:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,986 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2019-11-24 04:32:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:18,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-24 04:32:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,987 INFO L225 Difference]: With dead ends: 112 [2019-11-24 04:32:18,987 INFO L226 Difference]: Without dead ends: 107 [2019-11-24 04:32:18,988 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:32:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-24 04:32:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2019-11-24 04:32:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-24 04:32:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2019-11-24 04:32:19,000 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 36 [2019-11-24 04:32:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:19,001 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2019-11-24 04:32:19,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2019-11-24 04:32:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:32:19,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:19,001 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:32:19,002 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:19,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:19,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1813100635, now seen corresponding path program 1 times [2019-11-24 04:32:19,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:19,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505342197] [2019-11-24 04:32:19,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:19,070 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:32:19,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505342197] [2019-11-24 04:32:19,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:19,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:32:19,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975984451] [2019-11-24 04:32:19,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:32:19,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:19,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:32:19,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:32:19,072 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 7 states. [2019-11-24 04:32:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:19,187 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-11-24 04:32:19,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:19,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-24 04:32:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:19,189 INFO L225 Difference]: With dead ends: 129 [2019-11-24 04:32:19,189 INFO L226 Difference]: Without dead ends: 88 [2019-11-24 04:32:19,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:32:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-24 04:32:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-24 04:32:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-24 04:32:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-11-24 04:32:19,199 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 37 [2019-11-24 04:32:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:19,200 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-11-24 04:32:19,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:32:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-11-24 04:32:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:32:19,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:19,200 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:32:19,201 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:19,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash 886532451, now seen corresponding path program 1 times [2019-11-24 04:32:19,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:19,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737518212] [2019-11-24 04:32:19,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:19,287 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:32:19,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737518212] [2019-11-24 04:32:19,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:19,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:32:19,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692258535] [2019-11-24 04:32:19,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:32:19,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:32:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:32:19,289 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 8 states. [2019-11-24 04:32:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:19,667 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2019-11-24 04:32:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:32:19,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-11-24 04:32:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:19,669 INFO L225 Difference]: With dead ends: 138 [2019-11-24 04:32:19,669 INFO L226 Difference]: Without dead ends: 122 [2019-11-24 04:32:19,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:32:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-24 04:32:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-11-24 04:32:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-24 04:32:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2019-11-24 04:32:19,692 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 37 [2019-11-24 04:32:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:19,692 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2019-11-24 04:32:19,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:32:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2019-11-24 04:32:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:32:19,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:19,693 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] [2019-11-24 04:32:19,694 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1399822481, now seen corresponding path program 1 times [2019-11-24 04:32:19,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:19,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606926536] [2019-11-24 04:32:19,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:19,754 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:32:19,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606926536] [2019-11-24 04:32:19,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:19,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:19,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755893317] [2019-11-24 04:32:19,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:19,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:19,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:19,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:19,758 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand 6 states. [2019-11-24 04:32:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:19,862 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2019-11-24 04:32:19,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:19,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-24 04:32:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:19,863 INFO L225 Difference]: With dead ends: 102 [2019-11-24 04:32:19,864 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 04:32:19,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:32:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 04:32:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 04:32:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 04:32:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-24 04:32:19,882 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 40 [2019-11-24 04:32:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:19,883 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-24 04:32:19,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-24 04:32:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:32:19,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:19,884 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] [2019-11-24 04:32:19,884 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:19,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash -418689955, now seen corresponding path program 1 times [2019-11-24 04:32:19,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:19,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503608207] [2019-11-24 04:32:19,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:19,974 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:32:19,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503608207] [2019-11-24 04:32:19,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:19,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:19,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517480241] [2019-11-24 04:32:19,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:19,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:19,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:19,976 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2019-11-24 04:32:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,060 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-11-24 04:32:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:20,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-24 04:32:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,061 INFO L225 Difference]: With dead ends: 84 [2019-11-24 04:32:20,061 INFO L226 Difference]: Without dead ends: 66 [2019-11-24 04:32:20,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:32:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-24 04:32:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-24 04:32:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-24 04:32:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2019-11-24 04:32:20,073 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 46 [2019-11-24 04:32:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,073 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2019-11-24 04:32:20,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2019-11-24 04:32:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:32:20,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,074 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] [2019-11-24 04:32:20,074 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1808135729, now seen corresponding path program 1 times [2019-11-24 04:32:20,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682866310] [2019-11-24 04:32:20,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,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:32:20,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682866310] [2019-11-24 04:32:20,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:20,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264636491] [2019-11-24 04:32:20,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:20,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:20,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:20,178 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 6 states. [2019-11-24 04:32:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,291 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2019-11-24 04:32:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:20,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-24 04:32:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,293 INFO L225 Difference]: With dead ends: 84 [2019-11-24 04:32:20,293 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:32:20,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:32:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:32:20,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-24 04:32:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-24 04:32:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-11-24 04:32:20,306 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 49 [2019-11-24 04:32:20,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,306 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-11-24 04:32:20,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-11-24 04:32:20,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:32:20,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,307 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:32:20,308 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1375865821, now seen corresponding path program 1 times [2019-11-24 04:32:20,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477526663] [2019-11-24 04:32:20,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,477 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:32:20,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477526663] [2019-11-24 04:32:20,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:32:20,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222794572] [2019-11-24 04:32:20,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:32:20,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:32:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:32:20,480 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2019-11-24 04:32:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,777 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-11-24 04:32:20,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:32:20,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-24 04:32:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,778 INFO L225 Difference]: With dead ends: 89 [2019-11-24 04:32:20,778 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:32:20,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:32:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:32:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-24 04:32:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-24 04:32:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-24 04:32:20,789 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 51 [2019-11-24 04:32:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,789 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-24 04:32:20,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:32:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-24 04:32:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 04:32:20,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,790 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] [2019-11-24 04:32:20,790 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash 792624989, now seen corresponding path program 1 times [2019-11-24 04:32:20,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668114245] [2019-11-24 04:32:20,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,900 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:32:20,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668114245] [2019-11-24 04:32:20,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:32:20,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542961279] [2019-11-24 04:32:20,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:32:20,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:32:20,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:32:20,903 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 9 states. [2019-11-24 04:32:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,058 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-24 04:32:21,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:32:21,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-24 04:32:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,059 INFO L225 Difference]: With dead ends: 80 [2019-11-24 04:32:21,059 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:32:21,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-11-24 04:32:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:32:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:32:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:32:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:32:21,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2019-11-24 04:32:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,061 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:32:21,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:32:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:32:21,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:32:21,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:32:21,285 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 131 [2019-11-24 04:32:22,488 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-11-24 04:32:22,921 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-11-24 04:32:23,563 WARN L192 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-11-24 04:32:23,726 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-11-24 04:32:24,038 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-11-24 04:32:24,466 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-11-24 04:32:25,814 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 178 DAG size of output: 112 [2019-11-24 04:32:26,405 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-11-24 04:32:27,390 WARN L192 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 115 [2019-11-24 04:32:27,530 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-11-24 04:32:27,689 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-11-24 04:32:28,395 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-11-24 04:32:28,592 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-11-24 04:32:28,857 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-11-24 04:32:29,130 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-11-24 04:32:29,584 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-11-24 04:32:30,341 WARN L192 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 110 [2019-11-24 04:32:30,848 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 84 [2019-11-24 04:32:31,387 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-11-24 04:32:31,619 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-24 04:32:32,310 WARN L192 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 110 [2019-11-24 04:32:32,915 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 99 [2019-11-24 04:32:33,180 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-11-24 04:32:33,330 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-11-24 04:32:33,534 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-11-24 04:32:34,144 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 94 [2019-11-24 04:32:34,730 WARN L192 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-11-24 04:32:34,735 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,736 INFO L440 ceAbstractionStarter]: At program point L432(lines 161 434) the Hoare annotation is: (let ((.cse14 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse15 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse8 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse6 (= ~s~0 ~DC~0)) (.cse2 (= 0 ~pended~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse17 (= ~SKIP2~0 ~s~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~myStatus~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse1 .cse2 .cse11 .cse6) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse14 .cse10 .cse11 .cse13 .cse15 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741670) 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) .cse6 .cse7 .cse9 .cse10 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse14 .cse10 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse11 .cse13 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)) .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse11 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) .cse6 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse10 .cse0 .cse1 .cse2 .cse11 .cse3 .cse13 .cse16 .cse17 .cse18 .cse7 .cse9) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 .cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse3 .cse16 .cse17 .cse7 .cse9 .cse10 .cse11 .cse13 .cse18))) [2019-11-24 04:32:34,736 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,737 INFO L440 ceAbstractionStarter]: At program point L763(lines 756 802) the Hoare annotation is: (let ((.cse12 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse13 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse14 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse2 (<= (+ ~s~0 5) ~IPC~0)) (.cse3 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse4 (= ~s~0 ~DC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse8 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse2 .cse4 .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse7 .cse12 .cse8 .cse9 .cse13 .cse11 .cse14 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse12 .cse8 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse9 .cse11 .cse13 .cse14) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse9 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse4) (and .cse8 .cse0 .cse9 .cse1 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (= ~SKIP2~0 ~s~0) (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) .cse5 .cse7 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~myStatus~0 0) .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-11-24 04:32:34,737 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,737 INFO L447 ceAbstractionStarter]: At program point L764(lines 748 803) the Hoare annotation is: true [2019-11-24 04:32:34,737 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 308) no Hoare annotation was computed. [2019-11-24 04:32:34,737 INFO L444 ceAbstractionStarter]: For program point L765(lines 765 800) no Hoare annotation was computed. [2019-11-24 04:32:34,737 INFO L444 ceAbstractionStarter]: For program point L237-1(lines 230 418) no Hoare annotation was computed. [2019-11-24 04:32:34,737 INFO L444 ceAbstractionStarter]: For program point L766(lines 766 799) no Hoare annotation was computed. [2019-11-24 04:32:34,738 INFO L440 ceAbstractionStarter]: At program point L568(lines 529 594) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse10 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse17 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse18 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse11 (<= (+ .cse20 1) 0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse10 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse15 .cse16)))) [2019-11-24 04:32:34,738 INFO L444 ceAbstractionStarter]: For program point L767(lines 767 777) no Hoare annotation was computed. [2019-11-24 04:32:34,738 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 774) no Hoare annotation was computed. [2019-11-24 04:32:34,738 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,738 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 247) no Hoare annotation was computed. [2019-11-24 04:32:34,738 INFO L444 ceAbstractionStarter]: For program point L1034(lines 1034 1053) no Hoare annotation was computed. [2019-11-24 04:32:34,738 INFO L444 ceAbstractionStarter]: For program point L1034-1(lines 1034 1053) no Hoare annotation was computed. [2019-11-24 04:32:34,738 INFO L444 ceAbstractionStarter]: For program point L1034-2(lines 1034 1053) no Hoare annotation was computed. [2019-11-24 04:32:34,738 INFO L444 ceAbstractionStarter]: For program point L1034-3(lines 1034 1053) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 643) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point L638-2(lines 638 643) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1040) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point L1035-2(lines 1035 1040) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point L1035-4(lines 1035 1040) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point L1035-6(lines 1035 1040) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,739 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 117) no Hoare annotation was computed. [2019-11-24 04:32:34,740 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,740 INFO L440 ceAbstractionStarter]: At program point L708(lines 702 806) the Hoare annotation is: (let ((.cse3 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse10 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0)) (.cse11 (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0)) (.cse12 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (<= ULTIMATE.start_main_~status~1 0)) (.cse17 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse14 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (= ~s~0 ~DC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse18 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse7 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse19 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse20 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse14 .cse15 .cse5 .cse16 (<= ~myStatus~0 0) .cse6 .cse7 .cse8 .cse17 .cse9) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse1 .cse8 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse15) (and .cse8 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) (= 0 (+ ULTIMATE.start_main_~status~1 1073741823)) .cse15 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse13 .cse14 .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse17 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse5 .cse6 .cse18 .cse7 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse19 .cse9 .cse20) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse14 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse15 .cse5 .cse6 .cse18 .cse7 .cse8 .cse19 .cse9 .cse20 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))))) [2019-11-24 04:32:34,740 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,740 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,740 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 384) no Hoare annotation was computed. [2019-11-24 04:32:34,741 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,741 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,741 INFO L440 ceAbstractionStarter]: At program point L645(lines 613 647) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= (+ ~s~0 5) ~MPR3~0)) (.cse8 (<= 1 ~compRegistered~0)) (.cse9 (<= (+ .cse18 1) 0)) (.cse16 (<= ULTIMATE.start_main_~status~1 0)) (.cse17 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse12 .cse13 .cse14) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse15 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse16 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse14)))) [2019-11-24 04:32:34,741 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 518) no Hoare annotation was computed. [2019-11-24 04:32:34,742 INFO L440 ceAbstractionStarter]: At program point L513-2(lines 513 518) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-11-24 04:32:34,742 INFO L440 ceAbstractionStarter]: At program point L1042(lines 1034 1053) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,742 INFO L440 ceAbstractionStarter]: At program point L1042-1(lines 1034 1053) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,742 INFO L440 ceAbstractionStarter]: At program point L1042-2(lines 1034 1053) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,743 INFO L440 ceAbstractionStarter]: At program point L1042-3(lines 1034 1053) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,743 INFO L440 ceAbstractionStarter]: At program point L977(lines 941 1005) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,743 INFO L440 ceAbstractionStarter]: At program point L977-1(lines 941 1005) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,743 INFO L440 ceAbstractionStarter]: At program point L977-2(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,743 INFO L440 ceAbstractionStarter]: At program point L977-3(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,744 INFO L440 ceAbstractionStarter]: At program point L977-4(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,744 INFO L440 ceAbstractionStarter]: At program point L977-5(lines 941 1005) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,744 INFO L440 ceAbstractionStarter]: At program point L977-6(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,745 INFO L440 ceAbstractionStarter]: At program point L779(lines 766 799) the Hoare annotation is: (let ((.cse1 (= ~SKIP2~0 ~s~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~s~0 ~DC~0))) (let ((.cse3 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse4 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= ULTIMATE.start_main_~status~1 0)) (.cse7 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse8 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse5 (<= (+ ~s~0 5) ~IPC~0)) (.cse9 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse0 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (let ((.cse12 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse13 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse14 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse12 .cse13 .cse10 .cse14 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) .cse15 .cse16 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse12 .cse13 .cse10 .cse14 .cse11 .cse15 .cse16))))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse2 .cse4 .cse5 .cse6) (and (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse0 .cse7 .cse2 .cse5 .cse8 .cse9) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse11) (and .cse3 .cse0 .cse2 .cse4 .cse5 .cse6 (<= ~myStatus~0 0)) (and (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse7 .cse0 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse2 .cse8 .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse9 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (<= (+ ULTIMATE.start_main_~status~1 1073741675) 0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~s~0 ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741675) ~IPC~0) .cse0 .cse2 (<= (+ |ULTIMATE.start_FloppyPnp_#res| ~s~0 1073741675) ~IPC~0) (<= (+ ~s~0 ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741675) ~IPC~0) (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| ~DC~0 1073741675) ~IPC~0))))) [2019-11-24 04:32:34,745 INFO L440 ceAbstractionStarter]: At program point L977-7(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,745 INFO L440 ceAbstractionStarter]: At program point L977-8(lines 941 1005) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,745 INFO L440 ceAbstractionStarter]: At program point L119(lines 119 149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,745 INFO L444 ceAbstractionStarter]: For program point L119-2(lines 111 159) no Hoare annotation was computed. [2019-11-24 04:32:34,745 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,746 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 332) no Hoare annotation was computed. [2019-11-24 04:32:34,746 INFO L444 ceAbstractionStarter]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2019-11-24 04:32:34,746 INFO L440 ceAbstractionStarter]: At program point L1047-1(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~DC~0 5) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-11-24 04:32:34,746 INFO L444 ceAbstractionStarter]: For program point L1047-2(lines 1047 1051) no Hoare annotation was computed. [2019-11-24 04:32:34,746 INFO L440 ceAbstractionStarter]: At program point L1047-3(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-11-24 04:32:34,746 INFO L444 ceAbstractionStarter]: For program point L1047-4(lines 1047 1051) no Hoare annotation was computed. [2019-11-24 04:32:34,747 INFO L440 ceAbstractionStarter]: At program point L1047-5(lines 1047 1051) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,747 INFO L444 ceAbstractionStarter]: For program point L1047-6(lines 1047 1051) no Hoare annotation was computed. [2019-11-24 04:32:34,747 INFO L440 ceAbstractionStarter]: At program point L1047-7(lines 1047 1051) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= (+ ~DC~0 5) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-11-24 04:32:34,747 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:32:34,747 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,747 INFO L444 ceAbstractionStarter]: For program point L785(lines 785 797) no Hoare annotation was computed. [2019-11-24 04:32:34,747 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,747 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 790) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L985-1(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L985-2(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L985-3(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L985-4(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L985-5(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L985-6(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,748 INFO L444 ceAbstractionStarter]: For program point L985-7(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,749 INFO L444 ceAbstractionStarter]: For program point L985-8(lines 985 1002) no Hoare annotation was computed. [2019-11-24 04:32:34,749 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,749 INFO L444 ceAbstractionStarter]: For program point L325(lines 325 331) no Hoare annotation was computed. [2019-11-24 04:32:34,749 INFO L440 ceAbstractionStarter]: At program point L325-1(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:34,749 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,749 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 292) no Hoare annotation was computed. [2019-11-24 04:32:34,749 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,749 INFO L444 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-2(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-3(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-4(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-5(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-6(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-7(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-8(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-9(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-10(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,750 INFO L444 ceAbstractionStarter]: For program point L63-11(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-12(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-13(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-14(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-15(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-16(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-17(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-18(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-19(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-20(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-21(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,751 INFO L444 ceAbstractionStarter]: For program point L63-22(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,752 INFO L444 ceAbstractionStarter]: For program point L63-23(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,752 INFO L444 ceAbstractionStarter]: For program point L63-24(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,752 INFO L444 ceAbstractionStarter]: For program point L63-25(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,752 INFO L444 ceAbstractionStarter]: For program point L63-26(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,752 INFO L444 ceAbstractionStarter]: For program point L63-27(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,752 INFO L444 ceAbstractionStarter]: For program point L63-28(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,752 INFO L440 ceAbstractionStarter]: At program point L130(lines 130 137) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,752 INFO L444 ceAbstractionStarter]: For program point L63-29(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,753 INFO L444 ceAbstractionStarter]: For program point L63-30(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,753 INFO L440 ceAbstractionStarter]: At program point L64(lines 1007 1020) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ~s~0 ~DC~0)) [2019-11-24 04:32:34,753 INFO L444 ceAbstractionStarter]: For program point L63-31(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,753 INFO L444 ceAbstractionStarter]: For program point L63-32(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,753 INFO L444 ceAbstractionStarter]: For program point L63-33(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,753 INFO L444 ceAbstractionStarter]: For program point L63-34(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,753 INFO L440 ceAbstractionStarter]: At program point L64-4(lines 1 1149) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (not .cse1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or .cse1 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,754 INFO L444 ceAbstractionStarter]: For program point L63-35(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,754 INFO L444 ceAbstractionStarter]: For program point L63-36(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,754 INFO L444 ceAbstractionStarter]: For program point L63-37(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,754 INFO L440 ceAbstractionStarter]: At program point L64-7(lines 1 1149) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (not .cse1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or .cse1 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,754 INFO L444 ceAbstractionStarter]: For program point L63-38(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,754 INFO L444 ceAbstractionStarter]: For program point L63-39(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,755 INFO L440 ceAbstractionStarter]: At program point L64-9(lines 1007 1020) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse5 (= ~s~0 ~DC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse16 (<= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse11 .cse12 .cse13 .cse14) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 .cse15 .cse5 .cse6 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2019-11-24 04:32:34,755 INFO L440 ceAbstractionStarter]: At program point L64-10(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,755 INFO L440 ceAbstractionStarter]: At program point L64-12(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,755 INFO L440 ceAbstractionStarter]: At program point L64-13(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,756 INFO L440 ceAbstractionStarter]: At program point L64-15(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,756 INFO L440 ceAbstractionStarter]: At program point L64-17(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,756 INFO L440 ceAbstractionStarter]: At program point L64-19(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,756 INFO L440 ceAbstractionStarter]: At program point L64-21(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,756 INFO L440 ceAbstractionStarter]: At program point L64-25(lines 1 1149) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (not .cse1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or .cse1 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,756 INFO L440 ceAbstractionStarter]: At program point L64-28(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,757 INFO L440 ceAbstractionStarter]: At program point L64-30(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,757 INFO L440 ceAbstractionStarter]: At program point L64-31(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,757 INFO L440 ceAbstractionStarter]: At program point L64-33(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,757 INFO L440 ceAbstractionStarter]: At program point L64-34(lines 1 1149) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,757 INFO L444 ceAbstractionStarter]: For program point L924(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,757 INFO L440 ceAbstractionStarter]: At program point L64-36(lines 1 1149) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,757 INFO L444 ceAbstractionStarter]: For program point L924-2(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L924-4(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 796) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L924-6(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L924-8(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L924-10(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L924-12(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L924-14(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L924-16(lines 924 930) no Hoare annotation was computed. [2019-11-24 04:32:34,758 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 594) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 529 594) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L199(lines 199 207) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 571) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L994-2(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L994-4(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L994-6(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L994-8(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,759 INFO L444 ceAbstractionStarter]: For program point L994-10(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,760 INFO L444 ceAbstractionStarter]: For program point L994-12(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,760 INFO L440 ceAbstractionStarter]: At program point L532(lines 532 542) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= (+ .cse18 1) 0)) (.cse11 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse17)))) [2019-11-24 04:32:34,760 INFO L444 ceAbstractionStarter]: For program point L994-14(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,760 INFO L444 ceAbstractionStarter]: For program point L994-16(lines 994 1001) no Hoare annotation was computed. [2019-11-24 04:32:34,760 INFO L440 ceAbstractionStarter]: At program point L731(lines 731 746) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,761 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,761 INFO L440 ceAbstractionStarter]: At program point L665(lines 725 727) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,761 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,761 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,761 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,761 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 278) no Hoare annotation was computed. [2019-11-24 04:32:34,761 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,761 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,762 INFO L440 ceAbstractionStarter]: At program point L208(lines 208 427) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:34,762 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,762 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2019-11-24 04:32:34,762 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 341 346) no Hoare annotation was computed. [2019-11-24 04:32:34,762 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,762 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,762 INFO L447 ceAbstractionStarter]: At program point L805(lines 668 807) the Hoare annotation is: true [2019-11-24 04:32:34,762 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 426) no Hoare annotation was computed. [2019-11-24 04:32:34,763 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 147) no Hoare annotation was computed. [2019-11-24 04:32:34,763 INFO L440 ceAbstractionStarter]: At program point L544(lines 531 571) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse10 (<= (+ .cse18 1) 0)) (.cse11 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse2 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse17)))) [2019-11-24 04:32:34,763 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 425) no Hoare annotation was computed. [2019-11-24 04:32:34,763 INFO L440 ceAbstractionStarter]: At program point L215(lines 211 426) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,763 INFO L440 ceAbstractionStarter]: At program point L942(lines 942 954) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:34,764 INFO L440 ceAbstractionStarter]: At program point L942-1(lines 942 954) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,764 INFO L440 ceAbstractionStarter]: At program point L942-2(lines 942 954) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:34,764 INFO L440 ceAbstractionStarter]: At program point L942-3(lines 942 954) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,764 INFO L440 ceAbstractionStarter]: At program point L942-4(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,764 INFO L440 ceAbstractionStarter]: At program point L942-5(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,765 INFO L440 ceAbstractionStarter]: At program point L942-6(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,765 INFO L440 ceAbstractionStarter]: At program point L942-7(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,765 INFO L440 ceAbstractionStarter]: At program point L942-8(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,765 INFO L440 ceAbstractionStarter]: At program point L942-9(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,765 INFO L440 ceAbstractionStarter]: At program point L942-10(lines 942 954) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:34,766 INFO L440 ceAbstractionStarter]: At program point L942-11(lines 942 954) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= (+ .cse0 1) 0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:34,766 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,766 INFO L440 ceAbstractionStarter]: At program point L942-12(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,766 INFO L440 ceAbstractionStarter]: At program point L942-13(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,766 INFO L440 ceAbstractionStarter]: At program point L942-14(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,766 INFO L440 ceAbstractionStarter]: At program point L942-15(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,767 INFO L440 ceAbstractionStarter]: At program point L942-16(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,767 INFO L440 ceAbstractionStarter]: At program point L942-17(lines 942 954) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:34,767 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,767 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,767 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 424) no Hoare annotation was computed. [2019-11-24 04:32:34,767 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:32:34,767 INFO L440 ceAbstractionStarter]: At program point L86(lines 708 747) the Hoare annotation is: (let ((.cse1 (+ ~s~0 5)) (.cse0 (not (= ~s~0 ~NP~0)))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or .cse0 (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= .cse1 ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= .cse1 ~MPR3~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1))) [2019-11-24 04:32:34,768 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1017) no Hoare annotation was computed. [2019-11-24 04:32:34,768 INFO L444 ceAbstractionStarter]: For program point L1011-2(lines 1011 1017) no Hoare annotation was computed. [2019-11-24 04:32:34,768 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,768 INFO L444 ceAbstractionStarter]: For program point L1011-4(lines 1011 1017) no Hoare annotation was computed. [2019-11-24 04:32:34,768 INFO L444 ceAbstractionStarter]: For program point L1011-6(lines 1011 1017) no Hoare annotation was computed. [2019-11-24 04:32:34,768 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,768 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 423) no Hoare annotation was computed. [2019-11-24 04:32:34,768 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,769 INFO L444 ceAbstractionStarter]: For program point L749(lines 749 753) no Hoare annotation was computed. [2019-11-24 04:32:34,769 INFO L440 ceAbstractionStarter]: At program point L551-2(lines 551 567) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse10 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse17 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse18 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse11 (<= (+ .cse20 1) 0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)))) (or (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse17 .cse18 .cse19) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse10 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse15 .cse16)))) [2019-11-24 04:32:34,769 INFO L440 ceAbstractionStarter]: At program point L419(lines 230 420) the Hoare annotation is: (let ((.cse12 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= 0 ULTIMATE.start_main_~status~1)) (.cse8 (<= (+ ~DC~0 5) ~IPC~0)) (.cse9 (= 0 ~pended~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (= ~s~0 ~DC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (<= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 .cse1 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse3 .cse4 .cse5 (= ~SKIP2~0 ~s~0) .cse6 .cse7) (and .cse1 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse2 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse8 .cse9 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse10 .cse6 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse11 .cse7 .cse0 .cse3 .cse4 .cse12 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse1 .cse2 .cse8 .cse9 .cse5 .cse10 .cse6 .cse7 .cse0 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse3 .cse4 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)) .cse12) (and .cse1 .cse2 .cse8 .cse9 .cse5 .cse13 .cse10 .cse6 .cse11 (<= ~myStatus~0 0) .cse7 .cse0 .cse3 .cse4) (and .cse2 .cse3 .cse10 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse1 .cse2 .cse8 .cse9 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse5 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741670) 0) .cse10 .cse6 .cse7 .cse0 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse9 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse13 .cse10 .cse6 .cse11 .cse7 .cse0 .cse3 .cse4))) [2019-11-24 04:32:34,770 INFO L440 ceAbstractionStarter]: At program point L221(lines 217 424) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:34,770 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,770 INFO L444 ceAbstractionStarter]: For program point L948-2(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,770 INFO L444 ceAbstractionStarter]: For program point L948-4(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,770 INFO L444 ceAbstractionStarter]: For program point L948-6(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,770 INFO L444 ceAbstractionStarter]: For program point L948-8(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,770 INFO L444 ceAbstractionStarter]: For program point L948-10(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,771 INFO L440 ceAbstractionStarter]: At program point L552(lines 551 567) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (<= 0 ULTIMATE.start_main_~status~1)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse10 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= ~myStatus~0 0)) (.cse13 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse17 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse18 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse19 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse20) 3221225494))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~s~0 5) ~MPR3~0)) (.cse9 (<= 1 ~compRegistered~0)) (.cse11 (<= (+ .cse20 1) 0)) (.cse15 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse16 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1)))) (or (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse17 .cse18 .cse19) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse10 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)) .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse4 .cse5 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse15 .cse16)))) [2019-11-24 04:32:34,771 INFO L444 ceAbstractionStarter]: For program point L948-12(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,771 INFO L444 ceAbstractionStarter]: For program point L948-14(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,771 INFO L444 ceAbstractionStarter]: For program point L948-16(lines 948 952) no Hoare annotation was computed. [2019-11-24 04:32:34,771 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,771 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,771 INFO L440 ceAbstractionStarter]: At program point L223(lines 223 422) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,771 INFO L440 ceAbstractionStarter]: At program point L158(lines 98 160) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,772 INFO L440 ceAbstractionStarter]: At program point L226(lines 226 421) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,772 INFO L440 ceAbstractionStarter]: At program point L755(lines 748 803) the Hoare annotation is: (let ((.cse3 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse4 (= ~SKIP2~0 ~s~0)) (.cse10 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0)) (.cse11 (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0)) (.cse12 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (<= ULTIMATE.start_main_~status~1 0)) (.cse17 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse14 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (= ~s~0 ~DC~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse18 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258))) (.cse7 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse19 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse20 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse14 .cse15 .cse5 .cse16 (<= ~myStatus~0 0) .cse6 .cse7 .cse8 .cse17 .cse9) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse1 .cse8 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) .cse15) (and .cse8 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) (= 0 (+ ULTIMATE.start_main_~status~1 1073741823)) .cse15 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse13 .cse14 .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse17 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse5 .cse6 .cse18 .cse7 (or (not (= ~s~0 ~NP~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse8 .cse19 .cse9 .cse20) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse14 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse15 .cse5 .cse6 .cse18 .cse7 .cse8 .cse19 .cse9 .cse20 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))))) [2019-11-24 04:32:34,772 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,772 INFO L444 ceAbstractionStarter]: For program point L492(lines 492 504) no Hoare annotation was computed. [2019-11-24 04:32:34,772 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 761) no Hoare annotation was computed. [2019-11-24 04:32:34,772 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 367) no Hoare annotation was computed. [2019-11-24 04:32:34,773 INFO L440 ceAbstractionStarter]: At program point L229(lines 228 421) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:34,773 INFO L444 ceAbstractionStarter]: For program point L296-1(lines 230 418) no Hoare annotation was computed. [2019-11-24 04:32:34,773 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,773 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 630) no Hoare annotation was computed. [2019-11-24 04:32:34,773 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,773 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 565) no Hoare annotation was computed. [2019-11-24 04:32:34,773 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 503) no Hoare annotation was computed. [2019-11-24 04:32:34,774 INFO L440 ceAbstractionStarter]: At program point L497-1(lines 1 1149) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= 0 ULTIMATE.start_main_~status~1) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~compRegistered~0) (<= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:34,774 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 63) no Hoare annotation was computed. [2019-11-24 04:32:34,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:32:34 BoogieIcfgContainer [2019-11-24 04:32:34,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:32:34,855 INFO L168 Benchmark]: Toolchain (without parser) took 26821.85 ms. Allocated memory was 138.9 MB in the beginning and 607.1 MB in the end (delta: 468.2 MB). Free memory was 101.5 MB in the beginning and 482.7 MB in the end (delta: -381.2 MB). Peak memory consumption was 449.1 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:34,855 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 04:32:34,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.50 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.3 MB in the beginning and 169.7 MB in the end (delta: -68.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:34,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.29 ms. Allocated memory is still 202.4 MB. Free memory was 169.7 MB in the beginning and 161.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:34,856 INFO L168 Benchmark]: Boogie Preprocessor took 116.73 ms. Allocated memory is still 202.4 MB. Free memory was 161.6 MB in the beginning and 156.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:34,857 INFO L168 Benchmark]: RCFGBuilder took 2413.58 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 156.4 MB in the beginning and 129.0 MB in the end (delta: 27.4 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:34,857 INFO L168 Benchmark]: TraceAbstraction took 23561.47 ms. Allocated memory was 248.0 MB in the beginning and 607.1 MB in the end (delta: 359.1 MB). Free memory was 129.0 MB in the beginning and 482.7 MB in the end (delta: -353.7 MB). Peak memory consumption was 367.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:34,859 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.30 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 629.50 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.3 MB in the beginning and 169.7 MB in the end (delta: -68.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.29 ms. Allocated memory is still 202.4 MB. Free memory was 169.7 MB in the beginning and 161.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.73 ms. Allocated memory is still 202.4 MB. Free memory was 161.6 MB in the beginning and 156.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2413.58 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 156.4 MB in the beginning and 129.0 MB in the end (delta: 27.4 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23561.47 ms. Allocated memory was 248.0 MB in the beginning and 607.1 MB in the end (delta: 359.1 MB). Free memory was 129.0 MB in the beginning and 482.7 MB in the end (delta: -353.7 MB). Peak memory consumption was 367.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 63]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || ((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && ntStatus + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 731]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && 0 <= status) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: (((((((((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((0 <= status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 <= status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: (((((((DC + 2 <= SKIP2 && SKIP2 == s) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) || ((((((\result <= 0 && DC + 2 <= SKIP2) && ntStatus <= 0) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && ntStatus <= 0) && s + 5 <= IPC) && status <= 0)) || ((((((((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (260 <= \result || \result <= 258))) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((\result <= 0 && DC + 2 <= SKIP2) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && ntStatus <= 0) && s + 5 <= IPC) && status <= 0) && myStatus <= 0)) || (((((((((((258 < __cil_tmp11 || ntStatus <= __cil_tmp11) && (260 <= \result || \result <= 258)) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && (260 <= ntStatus || ntStatus <= 258)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (260 <= \result || \result <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((status + 1073741675 <= 0 && DC + 5 <= IPC) && s + ntStatus + 1073741675 <= IPC) && DC + 2 <= SKIP2) && (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status) || ((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1))) && \result + s + 1073741675 <= IPC) && s + ntStatus + 1073741675 <= IPC) && \result + DC + 1073741675 <= IPC) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && 0 <= status) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && 0 <= status) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((NP + 2 <= SKIP1 && 0 <= status) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || ((((\result + 1073741738 <= 0 && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && s == DC)) || ((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((((((((((((\result + 1073741670 <= 0 && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus + 1073741670 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || ((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || ((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((0 <= status && NP + 5 <= MPR3) && \result + 1073741823 == 0) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 668]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: (((((((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && 0 == pended) && s == NP) && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 532]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || ((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((NP + 5 <= MPR3 && \result + 1073741823 == 0) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((0 <= status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((0 <= status && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 2 <= s) && SKIP2 + NP + 5 <= IPC + SKIP1) && SKIP1 == s - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((\result + 1073741738 <= 0 && 0 == pended) && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((NP + 5 <= MPR3 && \result + 1073741823 == 0) && 0 == status + 1073741823) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((ntStatus <= lowerDriverReturn && returnVal2 <= lowerDriverReturn) && NP + 2 <= SKIP1) && 0 <= status) && lowerDriverReturn <= ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && 0 <= status) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || ((((0 <= status && NP + 5 <= MPR3) && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1)) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus + 1073741670 <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && 0 <= status) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && DC + 2 <= SKIP2 - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((0 <= status && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && ((!(s == NP) || 260 <= ntStatus) || ntStatus <= 258)) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status <= lowerDriverReturn) && lowerDriverReturn <= status - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((((((NP + 2 <= SKIP1 && 0 <= status) && 0 == pended) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || ((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && ((!(s == NP) || returnVal2 <= 258) || 259 < returnVal2)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258))) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && lowerDriverReturn <= \result) && SKIP2 == s) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && lowerDriverReturn <= status)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && 0 <= status) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((((((NP + 2 <= SKIP1 && 0 <= status) && ntStatus + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && status <= 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((((((0 <= status && DC + 5 <= IPC) && 0 == pended) && (260 <= ntStatus || ntStatus <= 258)) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) && NP + 2 <= SKIP1) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s + 5 <= MPR3) && 1 <= compRegistered) && __cil_tmp7 / 4294967296 + 1 <= 0) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 255 locations, 40 error locations. Result: SAFE, OverallTime: 23.4s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.6s, HoareTripleCheckerStatistics: 6437 SDtfs, 6029 SDslu, 7747 SDs, 0 SdLazy, 3707 SolverSat, 486 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 561 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 82 PreInvPairs, 253 NumberOfFragments, 8486 HoareAnnotationTreeSize, 82 FomulaSimplifications, 579919 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 82 FomulaSimplificationsInter, 85953 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 948 ConstructedInterpolants, 0 QuantifiedInterpolants, 89709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...