/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_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:32:11,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:32:11,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:32:11,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:32:11,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:32:11,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:32:11,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:32:11,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:32:11,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:32:11,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:32:11,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:32:11,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:32:11,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:32:11,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:32:11,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:32:11,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:32:11,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:32:11,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:32:11,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:32:11,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:32:11,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:32:11,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:32:11,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:32:11,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:32:11,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:32:11,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:32:11,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:32:11,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:32:11,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:32:11,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:32:11,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:32:11,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:32:11,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:32:11,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:32:11,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:32:11,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:32:11,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:32:11,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:32:11,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:32:11,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:32:11,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:32:11,836 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:11,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:32:11,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:32:11,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:32:11,875 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:32:11,875 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:32:11,876 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:32:11,876 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:32:11,876 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:32:11,876 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:32:11,876 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:32:11,876 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:32:11,878 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:32:11,878 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:32:11,878 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:32:11,878 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:32:11,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:32:11,879 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:32:11,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:32:11,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:32:11,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:32:11,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:32:11,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:32:11,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:32:11,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:32:11,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:32:11,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:32:11,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:32:11,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:32:11,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:32:11,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:32:11,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:32:11,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:32:11,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:32:11,883 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:32:11,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:32:11,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:32:11,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:32:11,884 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:32:12,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:32:12,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:32:12,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:32:12,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:32:12,195 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:32:12,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-24 04:32:12,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff9d6c1b/abf8118dec6141a6a76aeacd2a3799c5/FLAGfe2c72e9f [2019-11-24 04:32:12,790 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:32:12,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-24 04:32:12,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff9d6c1b/abf8118dec6141a6a76aeacd2a3799c5/FLAGfe2c72e9f [2019-11-24 04:32:13,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff9d6c1b/abf8118dec6141a6a76aeacd2a3799c5 [2019-11-24 04:32:13,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:32:13,121 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:32:13,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:32:13,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:32:13,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:32:13,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:32:13" (1/1) ... [2019-11-24 04:32:13,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b8ee53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:13, skipping insertion in model container [2019-11-24 04:32:13,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:32:13" (1/1) ... [2019-11-24 04:32:13,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:32:13,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:32:13,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:32:13,718 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:32:13,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:32:13,879 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:32:13,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:13 WrapperNode [2019-11-24 04:32:13,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:32:13,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:32:13,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:32:13,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:32:13,887 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:13" (1/1) ... [2019-11-24 04:32:13,915 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:13" (1/1) ... [2019-11-24 04:32:14,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:32:14,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:32:14,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:32:14,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:32:14,027 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:13" (1/1) ... [2019-11-24 04:32:14,028 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:13" (1/1) ... [2019-11-24 04:32:14,037 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:13" (1/1) ... [2019-11-24 04:32:14,038 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:13" (1/1) ... [2019-11-24 04:32:14,072 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:13" (1/1) ... [2019-11-24 04:32:14,102 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:13" (1/1) ... [2019-11-24 04:32:14,111 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:13" (1/1) ... [2019-11-24 04:32:14,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:32:14,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:32:14,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:32:14,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:32:14,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:13" (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:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:32:14,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:32:14,523 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,537 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,541 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,546 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,547 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,548 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,552 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,558 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,563 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,565 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,569 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,570 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,574 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,579 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,580 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,581 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,586 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,589 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,589 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,590 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,592 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,594 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,598 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,603 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,605 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,608 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,610 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,611 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,612 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:14,614 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 04:32:15,904 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-11-24 04:32:15,904 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-11-24 04:32:15,905 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-11-24 04:32:15,905 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-11-24 04:32:15,905 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-11-24 04:32:15,905 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-11-24 04:32:15,905 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-11-24 04:32:15,905 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-11-24 04:32:15,906 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-11-24 04:32:15,906 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-11-24 04:32:15,906 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-24 04:32:15,907 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-24 04:32:15,907 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-24 04:32:15,907 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-24 04:32:15,907 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-11-24 04:32:15,907 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-11-24 04:32:15,907 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-11-24 04:32:15,907 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-11-24 04:32:15,908 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-24 04:32:15,908 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-24 04:32:15,909 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-11-24 04:32:15,909 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-24 04:32:15,909 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-24 04:32:15,909 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-11-24 04:32:15,910 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-11-24 04:32:15,910 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-11-24 04:32:15,910 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-11-24 04:32:15,911 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-11-24 04:32:15,911 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-11-24 04:32:15,912 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-11-24 04:32:15,912 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-11-24 04:32:15,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-11-24 04:32:15,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-11-24 04:32:15,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-11-24 04:32:15,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-11-24 04:32:15,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-11-24 04:32:15,916 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-24 04:32:15,917 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-24 04:32:15,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-11-24 04:32:15,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-11-24 04:32:15,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-11-24 04:32:15,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-11-24 04:32:15,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-11-24 04:32:15,919 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-11-24 04:32:15,926 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-11-24 04:32:15,926 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-11-24 04:32:15,926 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-11-24 04:32:15,926 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-11-24 04:32:15,926 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-11-24 04:32:15,927 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-11-24 04:32:15,927 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-11-24 04:32:15,927 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-11-24 04:32:15,927 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-11-24 04:32:15,927 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-11-24 04:32:15,927 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-24 04:32:15,927 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-24 04:32:15,928 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-11-24 04:32:15,928 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-11-24 04:32:15,929 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-24 04:32:15,929 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-24 04:32:17,054 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:32:17,054 INFO L284 CfgBuilder]: Removed 275 assume(true) statements. [2019-11-24 04:32:17,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:32:17 BoogieIcfgContainer [2019-11-24 04:32:17,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:32:17,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:32:17,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:32:17,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:32:17,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:32:13" (1/3) ... [2019-11-24 04:32:17,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26869774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:32:17, skipping insertion in model container [2019-11-24 04:32:17,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:32:13" (2/3) ... [2019-11-24 04:32:17,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26869774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:32:17, skipping insertion in model container [2019-11-24 04:32:17,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:32:17" (3/3) ... [2019-11-24 04:32:17,066 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-11-24 04:32:17,076 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:32:17,085 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2019-11-24 04:32:17,097 INFO L249 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2019-11-24 04:32:17,140 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:32:17,141 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:32:17,141 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:32:17,141 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:32:17,142 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:32:17,142 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:32:17,142 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:32:17,142 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:32:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states. [2019-11-24 04:32:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 04:32:17,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:17,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 04:32:17,184 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash -286077311, now seen corresponding path program 1 times [2019-11-24 04:32:17,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:17,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517731749] [2019-11-24 04:32:17,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:17,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517731749] [2019-11-24 04:32:17,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:17,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:17,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957888794] [2019-11-24 04:32:17,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:17,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:17,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:17,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:17,418 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 3 states. [2019-11-24 04:32:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:17,849 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2019-11-24 04:32:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:17,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-24 04:32:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:17,866 INFO L225 Difference]: With dead ends: 637 [2019-11-24 04:32:17,866 INFO L226 Difference]: Without dead ends: 359 [2019-11-24 04:32:17,877 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:17,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-24 04:32:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2019-11-24 04:32:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-24 04:32:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 464 transitions. [2019-11-24 04:32:17,982 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 464 transitions. Word has length 6 [2019-11-24 04:32:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:17,982 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 464 transitions. [2019-11-24 04:32:17,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2019-11-24 04:32:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:32:17,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:17,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:17,985 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash 383646239, now seen corresponding path program 1 times [2019-11-24 04:32:17,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:17,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527940122] [2019-11-24 04:32:17,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:18,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527940122] [2019-11-24 04:32:18,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:32:18,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241457517] [2019-11-24 04:32:18,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:18,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:18,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:18,048 INFO L87 Difference]: Start difference. First operand 342 states and 464 transitions. Second operand 3 states. [2019-11-24 04:32:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,124 INFO L93 Difference]: Finished difference Result 378 states and 507 transitions. [2019-11-24 04:32:18,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:18,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 04:32:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,127 INFO L225 Difference]: With dead ends: 378 [2019-11-24 04:32:18,127 INFO L226 Difference]: Without dead ends: 359 [2019-11-24 04:32:18,128 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:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-24 04:32:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2019-11-24 04:32:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-24 04:32:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 463 transitions. [2019-11-24 04:32:18,146 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 463 transitions. Word has length 10 [2019-11-24 04:32:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:18,147 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 463 transitions. [2019-11-24 04:32:18,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 463 transitions. [2019-11-24 04:32:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:32:18,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:18,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:18,148 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1848249011, now seen corresponding path program 1 times [2019-11-24 04:32:18,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:18,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586478193] [2019-11-24 04:32:18,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,235 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,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586478193] [2019-11-24 04:32:18,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:18,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015522990] [2019-11-24 04:32:18,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:18,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:18,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:18,238 INFO L87 Difference]: Start difference. First operand 342 states and 463 transitions. Second operand 3 states. [2019-11-24 04:32:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,292 INFO L93 Difference]: Finished difference Result 412 states and 547 transitions. [2019-11-24 04:32:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:18,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 04:32:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,294 INFO L225 Difference]: With dead ends: 412 [2019-11-24 04:32:18,295 INFO L226 Difference]: Without dead ends: 388 [2019-11-24 04:32:18,296 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:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-24 04:32:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 364. [2019-11-24 04:32:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-24 04:32:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 497 transitions. [2019-11-24 04:32:18,311 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 497 transitions. Word has length 11 [2019-11-24 04:32:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:18,312 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 497 transitions. [2019-11-24 04:32:18,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 497 transitions. [2019-11-24 04:32:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:32:18,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:18,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:18,314 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash -98212966, now seen corresponding path program 1 times [2019-11-24 04:32:18,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:18,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733621274] [2019-11-24 04:32:18,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,436 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,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733621274] [2019-11-24 04:32:18,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:18,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42984407] [2019-11-24 04:32:18,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:18,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:18,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:18,441 INFO L87 Difference]: Start difference. First operand 364 states and 497 transitions. Second operand 3 states. [2019-11-24 04:32:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,521 INFO L93 Difference]: Finished difference Result 602 states and 804 transitions. [2019-11-24 04:32:18,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:18,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-24 04:32:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,529 INFO L225 Difference]: With dead ends: 602 [2019-11-24 04:32:18,529 INFO L226 Difference]: Without dead ends: 426 [2019-11-24 04:32:18,531 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:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-24 04:32:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 342. [2019-11-24 04:32:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-24 04:32:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 463 transitions. [2019-11-24 04:32:18,558 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 463 transitions. Word has length 12 [2019-11-24 04:32:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:18,558 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 463 transitions. [2019-11-24 04:32:18,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 463 transitions. [2019-11-24 04:32:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:32:18,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:18,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:18,566 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1804879722, now seen corresponding path program 1 times [2019-11-24 04:32:18,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:18,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123008926] [2019-11-24 04:32:18,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,637 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,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123008926] [2019-11-24 04:32:18,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:18,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528034156] [2019-11-24 04:32:18,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:18,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:18,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:18,640 INFO L87 Difference]: Start difference. First operand 342 states and 463 transitions. Second operand 3 states. [2019-11-24 04:32:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,811 INFO L93 Difference]: Finished difference Result 366 states and 491 transitions. [2019-11-24 04:32:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:18,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 04:32:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,814 INFO L225 Difference]: With dead ends: 366 [2019-11-24 04:32:18,814 INFO L226 Difference]: Without dead ends: 361 [2019-11-24 04:32:18,814 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:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-24 04:32:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-11-24 04:32:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-24 04:32:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 486 transitions. [2019-11-24 04:32:18,829 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 486 transitions. Word has length 14 [2019-11-24 04:32:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:18,829 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 486 transitions. [2019-11-24 04:32:18,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 486 transitions. [2019-11-24 04:32:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:32:18,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:18,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:18,831 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 134153172, now seen corresponding path program 1 times [2019-11-24 04:32:18,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:18,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027477248] [2019-11-24 04:32:18,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,863 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,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027477248] [2019-11-24 04:32:18,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:18,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736437095] [2019-11-24 04:32:18,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:18,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:18,865 INFO L87 Difference]: Start difference. First operand 361 states and 486 transitions. Second operand 3 states. [2019-11-24 04:32:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:18,894 INFO L93 Difference]: Finished difference Result 373 states and 499 transitions. [2019-11-24 04:32:18,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:18,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:32:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:18,897 INFO L225 Difference]: With dead ends: 373 [2019-11-24 04:32:18,897 INFO L226 Difference]: Without dead ends: 357 [2019-11-24 04:32:18,897 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:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-24 04:32:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2019-11-24 04:32:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-24 04:32:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2019-11-24 04:32:18,913 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 15 [2019-11-24 04:32:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:18,913 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2019-11-24 04:32:18,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2019-11-24 04:32:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:32:18,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:18,914 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:18,915 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1662770972, now seen corresponding path program 1 times [2019-11-24 04:32:18,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:18,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070131014] [2019-11-24 04:32:18,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:18,946 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,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070131014] [2019-11-24 04:32:18,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:18,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:18,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250456722] [2019-11-24 04:32:18,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:18,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:18,949 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand 3 states. [2019-11-24 04:32:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:19,097 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2019-11-24 04:32:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:19,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:32:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:19,099 INFO L225 Difference]: With dead ends: 357 [2019-11-24 04:32:19,099 INFO L226 Difference]: Without dead ends: 341 [2019-11-24 04:32:19,100 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:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-24 04:32:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2019-11-24 04:32:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-24 04:32:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 463 transitions. [2019-11-24 04:32:19,117 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 463 transitions. Word has length 17 [2019-11-24 04:32:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:19,117 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 463 transitions. [2019-11-24 04:32:19,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2019-11-24 04:32:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:32:19,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:19,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] [2019-11-24 04:32:19,119 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:19,120 INFO L82 PathProgramCache]: Analyzing trace with hash -36105606, now seen corresponding path program 1 times [2019-11-24 04:32:19,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:19,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790954480] [2019-11-24 04:32:19,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:19,149 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,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790954480] [2019-11-24 04:32:19,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:19,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:19,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705866845] [2019-11-24 04:32:19,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:19,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:19,151 INFO L87 Difference]: Start difference. First operand 341 states and 463 transitions. Second operand 3 states. [2019-11-24 04:32:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:19,369 INFO L93 Difference]: Finished difference Result 421 states and 565 transitions. [2019-11-24 04:32:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:19,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:32:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:19,372 INFO L225 Difference]: With dead ends: 421 [2019-11-24 04:32:19,372 INFO L226 Difference]: Without dead ends: 413 [2019-11-24 04:32:19,373 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:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-24 04:32:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 353. [2019-11-24 04:32:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-24 04:32:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 481 transitions. [2019-11-24 04:32:19,389 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 481 transitions. Word has length 19 [2019-11-24 04:32:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:19,390 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 481 transitions. [2019-11-24 04:32:19,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 481 transitions. [2019-11-24 04:32:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:32:19,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:19,391 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:19,392 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1126931719, now seen corresponding path program 1 times [2019-11-24 04:32:19,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:19,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075208277] [2019-11-24 04:32:19,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:19,459 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,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075208277] [2019-11-24 04:32:19,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:19,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:19,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564471268] [2019-11-24 04:32:19,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:32:19,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:19,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:32:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:32:19,462 INFO L87 Difference]: Start difference. First operand 353 states and 481 transitions. Second operand 7 states. [2019-11-24 04:32:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:19,991 INFO L93 Difference]: Finished difference Result 453 states and 595 transitions. [2019-11-24 04:32:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:19,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-24 04:32:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:19,994 INFO L225 Difference]: With dead ends: 453 [2019-11-24 04:32:19,997 INFO L226 Difference]: Without dead ends: 400 [2019-11-24 04:32:19,997 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:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-11-24 04:32:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 345. [2019-11-24 04:32:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-11-24 04:32:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 466 transitions. [2019-11-24 04:32:20,023 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 466 transitions. Word has length 20 [2019-11-24 04:32:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,024 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 466 transitions. [2019-11-24 04:32:20,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:32:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 466 transitions. [2019-11-24 04:32:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:32:20,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,025 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:20,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1826034508, now seen corresponding path program 1 times [2019-11-24 04:32:20,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309712914] [2019-11-24 04:32:20,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,068 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,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309712914] [2019-11-24 04:32:20,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:20,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704285941] [2019-11-24 04:32:20,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:20,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:20,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:20,070 INFO L87 Difference]: Start difference. First operand 345 states and 466 transitions. Second operand 3 states. [2019-11-24 04:32:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,205 INFO L93 Difference]: Finished difference Result 451 states and 608 transitions. [2019-11-24 04:32:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:20,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:32:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,208 INFO L225 Difference]: With dead ends: 451 [2019-11-24 04:32:20,208 INFO L226 Difference]: Without dead ends: 342 [2019-11-24 04:32:20,209 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:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-24 04:32:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-11-24 04:32:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-24 04:32:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 462 transitions. [2019-11-24 04:32:20,227 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 462 transitions. Word has length 20 [2019-11-24 04:32:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,228 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 462 transitions. [2019-11-24 04:32:20,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 462 transitions. [2019-11-24 04:32:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:32:20,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,229 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:20,230 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1680674973, now seen corresponding path program 1 times [2019-11-24 04:32:20,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970088141] [2019-11-24 04:32:20,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,258 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,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970088141] [2019-11-24 04:32:20,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:20,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103720586] [2019-11-24 04:32:20,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:20,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:20,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:20,261 INFO L87 Difference]: Start difference. First operand 342 states and 462 transitions. Second operand 4 states. [2019-11-24 04:32:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,304 INFO L93 Difference]: Finished difference Result 355 states and 476 transitions. [2019-11-24 04:32:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:20,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 04:32:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,307 INFO L225 Difference]: With dead ends: 355 [2019-11-24 04:32:20,307 INFO L226 Difference]: Without dead ends: 340 [2019-11-24 04:32:20,308 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:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-24 04:32:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2019-11-24 04:32:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-24 04:32:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2019-11-24 04:32:20,357 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 20 [2019-11-24 04:32:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,358 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2019-11-24 04:32:20,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2019-11-24 04:32:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:32:20,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:20,359 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 670007894, now seen corresponding path program 1 times [2019-11-24 04:32:20,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674205097] [2019-11-24 04:32:20,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,404 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,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674205097] [2019-11-24 04:32:20,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:20,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156049677] [2019-11-24 04:32:20,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:20,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:20,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:20,407 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand 4 states. [2019-11-24 04:32:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,453 INFO L93 Difference]: Finished difference Result 353 states and 473 transitions. [2019-11-24 04:32:20,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:20,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 04:32:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,456 INFO L225 Difference]: With dead ends: 353 [2019-11-24 04:32:20,456 INFO L226 Difference]: Without dead ends: 338 [2019-11-24 04:32:20,456 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:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-24 04:32:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-11-24 04:32:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-11-24 04:32:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 456 transitions. [2019-11-24 04:32:20,475 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 456 transitions. Word has length 20 [2019-11-24 04:32:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,475 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 456 transitions. [2019-11-24 04:32:20,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 456 transitions. [2019-11-24 04:32:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:32:20,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,476 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:20,477 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,477 INFO L82 PathProgramCache]: Analyzing trace with hash -669854996, now seen corresponding path program 1 times [2019-11-24 04:32:20,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538874092] [2019-11-24 04:32:20,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,504 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,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538874092] [2019-11-24 04:32:20,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:20,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488179037] [2019-11-24 04:32:20,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:20,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:20,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:20,506 INFO L87 Difference]: Start difference. First operand 338 states and 456 transitions. Second operand 3 states. [2019-11-24 04:32:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,536 INFO L93 Difference]: Finished difference Result 378 states and 505 transitions. [2019-11-24 04:32:20,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:20,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:32:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,538 INFO L225 Difference]: With dead ends: 378 [2019-11-24 04:32:20,538 INFO L226 Difference]: Without dead ends: 324 [2019-11-24 04:32:20,539 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:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-24 04:32:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2019-11-24 04:32:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-24 04:32:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 431 transitions. [2019-11-24 04:32:20,554 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 431 transitions. Word has length 21 [2019-11-24 04:32:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,554 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 431 transitions. [2019-11-24 04:32:20,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 431 transitions. [2019-11-24 04:32:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:32:20,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,556 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:20,557 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2046524504, now seen corresponding path program 1 times [2019-11-24 04:32:20,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770129007] [2019-11-24 04:32:20,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,600 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,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770129007] [2019-11-24 04:32:20,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:20,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216157587] [2019-11-24 04:32:20,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:20,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:20,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:20,602 INFO L87 Difference]: Start difference. First operand 322 states and 431 transitions. Second operand 3 states. [2019-11-24 04:32:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,642 INFO L93 Difference]: Finished difference Result 419 states and 551 transitions. [2019-11-24 04:32:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:20,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:32:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,644 INFO L225 Difference]: With dead ends: 419 [2019-11-24 04:32:20,644 INFO L226 Difference]: Without dead ends: 318 [2019-11-24 04:32:20,645 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:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-24 04:32:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 304. [2019-11-24 04:32:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-24 04:32:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 401 transitions. [2019-11-24 04:32:20,661 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 401 transitions. Word has length 22 [2019-11-24 04:32:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,661 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 401 transitions. [2019-11-24 04:32:20,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 401 transitions. [2019-11-24 04:32:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:32:20,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,664 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:20,665 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1567103020, now seen corresponding path program 1 times [2019-11-24 04:32:20,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522400953] [2019-11-24 04:32:20,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,729 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,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522400953] [2019-11-24 04:32:20,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:20,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043960961] [2019-11-24 04:32:20,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:20,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:20,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:20,732 INFO L87 Difference]: Start difference. First operand 304 states and 401 transitions. Second operand 4 states. [2019-11-24 04:32:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:20,804 INFO L93 Difference]: Finished difference Result 342 states and 442 transitions. [2019-11-24 04:32:20,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:20,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-24 04:32:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:20,807 INFO L225 Difference]: With dead ends: 342 [2019-11-24 04:32:20,807 INFO L226 Difference]: Without dead ends: 321 [2019-11-24 04:32:20,810 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:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-24 04:32:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 306. [2019-11-24 04:32:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-24 04:32:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 403 transitions. [2019-11-24 04:32:20,833 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 403 transitions. Word has length 22 [2019-11-24 04:32:20,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:20,833 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 403 transitions. [2019-11-24 04:32:20,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 403 transitions. [2019-11-24 04:32:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:32:20,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:20,836 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:20,836 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:20,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:20,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1425627767, now seen corresponding path program 1 times [2019-11-24 04:32:20,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:20,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499619009] [2019-11-24 04:32:20,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:20,946 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,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499619009] [2019-11-24 04:32:20,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:20,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:32:20,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71115007] [2019-11-24 04:32:20,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:32:20,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:32:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:32:20,952 INFO L87 Difference]: Start difference. First operand 306 states and 403 transitions. Second operand 8 states. [2019-11-24 04:32:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,471 INFO L93 Difference]: Finished difference Result 324 states and 421 transitions. [2019-11-24 04:32:21,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:21,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-24 04:32:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,474 INFO L225 Difference]: With dead ends: 324 [2019-11-24 04:32:21,474 INFO L226 Difference]: Without dead ends: 319 [2019-11-24 04:32:21,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:32:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-24 04:32:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 306. [2019-11-24 04:32:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-24 04:32:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 402 transitions. [2019-11-24 04:32:21,502 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 402 transitions. Word has length 22 [2019-11-24 04:32:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,503 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 402 transitions. [2019-11-24 04:32:21,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:32:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 402 transitions. [2019-11-24 04:32:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:32:21,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,505 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:21,505 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash -14574734, now seen corresponding path program 1 times [2019-11-24 04:32:21,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495862189] [2019-11-24 04:32:21,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,546 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:21,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495862189] [2019-11-24 04:32:21,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:21,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319837828] [2019-11-24 04:32:21,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:21,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:21,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:21,550 INFO L87 Difference]: Start difference. First operand 306 states and 402 transitions. Second operand 3 states. [2019-11-24 04:32:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:21,593 INFO L93 Difference]: Finished difference Result 423 states and 546 transitions. [2019-11-24 04:32:21,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:21,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:32:21,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:21,596 INFO L225 Difference]: With dead ends: 423 [2019-11-24 04:32:21,597 INFO L226 Difference]: Without dead ends: 329 [2019-11-24 04:32:21,598 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:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-24 04:32:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 294. [2019-11-24 04:32:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-24 04:32:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 384 transitions. [2019-11-24 04:32:21,620 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 384 transitions. Word has length 23 [2019-11-24 04:32:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:21,620 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 384 transitions. [2019-11-24 04:32:21,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 384 transitions. [2019-11-24 04:32:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:32:21,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:21,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:21,622 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:21,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:21,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1774055580, now seen corresponding path program 1 times [2019-11-24 04:32:21,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:21,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306228993] [2019-11-24 04:32:21,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:21,762 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:21,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306228993] [2019-11-24 04:32:21,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:21,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:32:21,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914053200] [2019-11-24 04:32:21,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:32:21,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:21,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:32:21,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:32:21,764 INFO L87 Difference]: Start difference. First operand 294 states and 384 transitions. Second operand 8 states. [2019-11-24 04:32:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:22,205 INFO L93 Difference]: Finished difference Result 312 states and 401 transitions. [2019-11-24 04:32:22,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:22,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-24 04:32:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:22,207 INFO L225 Difference]: With dead ends: 312 [2019-11-24 04:32:22,207 INFO L226 Difference]: Without dead ends: 307 [2019-11-24 04:32:22,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:32:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-24 04:32:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2019-11-24 04:32:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-24 04:32:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 383 transitions. [2019-11-24 04:32:22,228 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 383 transitions. Word has length 23 [2019-11-24 04:32:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:22,228 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 383 transitions. [2019-11-24 04:32:22,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:32:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 383 transitions. [2019-11-24 04:32:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:32:22,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:22,229 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:22,229 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash 520162629, now seen corresponding path program 1 times [2019-11-24 04:32:22,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:22,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113682697] [2019-11-24 04:32:22,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:22,397 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:22,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113682697] [2019-11-24 04:32:22,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:22,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:22,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650628001] [2019-11-24 04:32:22,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:22,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:22,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:22,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:22,399 INFO L87 Difference]: Start difference. First operand 294 states and 383 transitions. Second operand 3 states. [2019-11-24 04:32:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:22,460 INFO L93 Difference]: Finished difference Result 394 states and 505 transitions. [2019-11-24 04:32:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:22,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:32:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:22,462 INFO L225 Difference]: With dead ends: 394 [2019-11-24 04:32:22,462 INFO L226 Difference]: Without dead ends: 296 [2019-11-24 04:32:22,463 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:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-24 04:32:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 282. [2019-11-24 04:32:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-24 04:32:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 365 transitions. [2019-11-24 04:32:22,486 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 365 transitions. Word has length 24 [2019-11-24 04:32:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:22,486 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 365 transitions. [2019-11-24 04:32:22,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 365 transitions. [2019-11-24 04:32:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:32:22,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:22,487 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:22,488 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1181802126, now seen corresponding path program 1 times [2019-11-24 04:32:22,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:22,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954969042] [2019-11-24 04:32:22,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:22,522 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:22,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954969042] [2019-11-24 04:32:22,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:22,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:22,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940259683] [2019-11-24 04:32:22,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:22,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:22,524 INFO L87 Difference]: Start difference. First operand 282 states and 365 transitions. Second operand 3 states. [2019-11-24 04:32:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:22,671 INFO L93 Difference]: Finished difference Result 373 states and 471 transitions. [2019-11-24 04:32:22,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:22,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:32:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:22,674 INFO L225 Difference]: With dead ends: 373 [2019-11-24 04:32:22,674 INFO L226 Difference]: Without dead ends: 353 [2019-11-24 04:32:22,674 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:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-24 04:32:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 299. [2019-11-24 04:32:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-24 04:32:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 382 transitions. [2019-11-24 04:32:22,707 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 382 transitions. Word has length 24 [2019-11-24 04:32:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:22,708 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 382 transitions. [2019-11-24 04:32:22,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 382 transitions. [2019-11-24 04:32:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:32:22,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:22,710 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:22,711 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 478588448, now seen corresponding path program 1 times [2019-11-24 04:32:22,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:22,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525886275] [2019-11-24 04:32:22,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:22,765 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:22,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525886275] [2019-11-24 04:32:22,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:22,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:22,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334663890] [2019-11-24 04:32:22,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:22,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:22,766 INFO L87 Difference]: Start difference. First operand 299 states and 382 transitions. Second operand 5 states. [2019-11-24 04:32:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:22,824 INFO L93 Difference]: Finished difference Result 312 states and 394 transitions. [2019-11-24 04:32:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:22,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 04:32:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:22,827 INFO L225 Difference]: With dead ends: 312 [2019-11-24 04:32:22,827 INFO L226 Difference]: Without dead ends: 295 [2019-11-24 04:32:22,827 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:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-24 04:32:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-11-24 04:32:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-24 04:32:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 377 transitions. [2019-11-24 04:32:22,848 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 377 transitions. Word has length 24 [2019-11-24 04:32:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:22,848 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 377 transitions. [2019-11-24 04:32:22,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 377 transitions. [2019-11-24 04:32:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:32:22,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:22,849 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:22,850 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash 903463757, now seen corresponding path program 1 times [2019-11-24 04:32:22,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:22,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754964975] [2019-11-24 04:32:22,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:22,893 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:22,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754964975] [2019-11-24 04:32:22,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:22,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:22,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492468838] [2019-11-24 04:32:22,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:22,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:22,895 INFO L87 Difference]: Start difference. First operand 295 states and 377 transitions. Second operand 4 states. [2019-11-24 04:32:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:23,125 INFO L93 Difference]: Finished difference Result 381 states and 484 transitions. [2019-11-24 04:32:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:23,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-24 04:32:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:23,127 INFO L225 Difference]: With dead ends: 381 [2019-11-24 04:32:23,128 INFO L226 Difference]: Without dead ends: 295 [2019-11-24 04:32:23,128 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:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-24 04:32:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-11-24 04:32:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-24 04:32:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 374 transitions. [2019-11-24 04:32:23,149 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 374 transitions. Word has length 25 [2019-11-24 04:32:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:23,149 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 374 transitions. [2019-11-24 04:32:23,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 374 transitions. [2019-11-24 04:32:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:32:23,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:23,151 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:23,151 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:23,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:23,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2001383120, now seen corresponding path program 1 times [2019-11-24 04:32:23,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:23,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990564251] [2019-11-24 04:32:23,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:23,194 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:23,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990564251] [2019-11-24 04:32:23,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:23,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:23,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204200595] [2019-11-24 04:32:23,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:23,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:23,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:23,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:23,196 INFO L87 Difference]: Start difference. First operand 295 states and 374 transitions. Second operand 5 states. [2019-11-24 04:32:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:23,466 INFO L93 Difference]: Finished difference Result 303 states and 381 transitions. [2019-11-24 04:32:23,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:23,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 04:32:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:23,468 INFO L225 Difference]: With dead ends: 303 [2019-11-24 04:32:23,468 INFO L226 Difference]: Without dead ends: 300 [2019-11-24 04:32:23,468 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:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-24 04:32:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-11-24 04:32:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-24 04:32:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 376 transitions. [2019-11-24 04:32:23,491 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 376 transitions. Word has length 25 [2019-11-24 04:32:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:23,492 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 376 transitions. [2019-11-24 04:32:23,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 376 transitions. [2019-11-24 04:32:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:32:23,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:23,493 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:23,493 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:23,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2001371204, now seen corresponding path program 1 times [2019-11-24 04:32:23,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:23,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570610853] [2019-11-24 04:32:23,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:23,543 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:23,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570610853] [2019-11-24 04:32:23,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:23,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:23,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18445699] [2019-11-24 04:32:23,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:23,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:23,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:23,545 INFO L87 Difference]: Start difference. First operand 297 states and 376 transitions. Second operand 5 states. [2019-11-24 04:32:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:23,816 INFO L93 Difference]: Finished difference Result 305 states and 382 transitions. [2019-11-24 04:32:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:23,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 04:32:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:23,820 INFO L225 Difference]: With dead ends: 305 [2019-11-24 04:32:23,820 INFO L226 Difference]: Without dead ends: 300 [2019-11-24 04:32:23,821 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:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-24 04:32:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-11-24 04:32:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-24 04:32:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 375 transitions. [2019-11-24 04:32:23,847 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 375 transitions. Word has length 25 [2019-11-24 04:32:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:23,847 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 375 transitions. [2019-11-24 04:32:23,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 375 transitions. [2019-11-24 04:32:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:32:23,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:23,848 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:23,849 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2110035990, now seen corresponding path program 1 times [2019-11-24 04:32:23,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:23,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963608072] [2019-11-24 04:32:23,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:23,881 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:23,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963608072] [2019-11-24 04:32:23,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:23,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:23,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627607002] [2019-11-24 04:32:23,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:23,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:23,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:23,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:23,883 INFO L87 Difference]: Start difference. First operand 297 states and 375 transitions. Second operand 4 states. [2019-11-24 04:32:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,069 INFO L93 Difference]: Finished difference Result 339 states and 418 transitions. [2019-11-24 04:32:24,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:24,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-24 04:32:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,071 INFO L225 Difference]: With dead ends: 339 [2019-11-24 04:32:24,071 INFO L226 Difference]: Without dead ends: 297 [2019-11-24 04:32:24,072 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:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-24 04:32:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-11-24 04:32:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-24 04:32:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 366 transitions. [2019-11-24 04:32:24,098 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 366 transitions. Word has length 25 [2019-11-24 04:32:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,099 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 366 transitions. [2019-11-24 04:32:24,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 366 transitions. [2019-11-24 04:32:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:32:24,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,100 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:24,100 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1677586694, now seen corresponding path program 1 times [2019-11-24 04:32:24,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239815347] [2019-11-24 04:32:24,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,171 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:24,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239815347] [2019-11-24 04:32:24,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:24,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556060874] [2019-11-24 04:32:24,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:24,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:24,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:24,173 INFO L87 Difference]: Start difference. First operand 297 states and 366 transitions. Second operand 5 states. [2019-11-24 04:32:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,517 INFO L93 Difference]: Finished difference Result 350 states and 431 transitions. [2019-11-24 04:32:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:24,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-24 04:32:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,519 INFO L225 Difference]: With dead ends: 350 [2019-11-24 04:32:24,519 INFO L226 Difference]: Without dead ends: 346 [2019-11-24 04:32:24,520 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:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-24 04:32:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 297. [2019-11-24 04:32:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-24 04:32:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 366 transitions. [2019-11-24 04:32:24,547 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 366 transitions. Word has length 26 [2019-11-24 04:32:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,548 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 366 transitions. [2019-11-24 04:32:24,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 366 transitions. [2019-11-24 04:32:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:32:24,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,549 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:24,549 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1095312260, now seen corresponding path program 1 times [2019-11-24 04:32:24,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829621875] [2019-11-24 04:32:24,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,624 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:24,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829621875] [2019-11-24 04:32:24,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:24,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990218048] [2019-11-24 04:32:24,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:24,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:24,626 INFO L87 Difference]: Start difference. First operand 297 states and 366 transitions. Second operand 6 states. [2019-11-24 04:32:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:24,848 INFO L93 Difference]: Finished difference Result 329 states and 398 transitions. [2019-11-24 04:32:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:32:24,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-24 04:32:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:24,850 INFO L225 Difference]: With dead ends: 329 [2019-11-24 04:32:24,850 INFO L226 Difference]: Without dead ends: 311 [2019-11-24 04:32:24,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:32:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-24 04:32:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 291. [2019-11-24 04:32:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-24 04:32:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 349 transitions. [2019-11-24 04:32:24,879 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 349 transitions. Word has length 26 [2019-11-24 04:32:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:24,879 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 349 transitions. [2019-11-24 04:32:24,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 349 transitions. [2019-11-24 04:32:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:32:24,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:24,880 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:24,880 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1852376873, now seen corresponding path program 1 times [2019-11-24 04:32:24,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:24,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861282120] [2019-11-24 04:32:24,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:24,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:24,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861282120] [2019-11-24 04:32:24,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:24,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:24,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332696753] [2019-11-24 04:32:24,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:24,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:24,915 INFO L87 Difference]: Start difference. First operand 291 states and 349 transitions. Second operand 4 states. [2019-11-24 04:32:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:25,065 INFO L93 Difference]: Finished difference Result 294 states and 351 transitions. [2019-11-24 04:32:25,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:25,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 04:32:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:25,067 INFO L225 Difference]: With dead ends: 294 [2019-11-24 04:32:25,067 INFO L226 Difference]: Without dead ends: 272 [2019-11-24 04:32:25,068 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:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-24 04:32:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-11-24 04:32:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-24 04:32:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 322 transitions. [2019-11-24 04:32:25,093 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 322 transitions. Word has length 26 [2019-11-24 04:32:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:25,093 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 322 transitions. [2019-11-24 04:32:25,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 322 transitions. [2019-11-24 04:32:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:32:25,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:25,094 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:25,095 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:25,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:25,095 INFO L82 PathProgramCache]: Analyzing trace with hash -799017805, now seen corresponding path program 1 times [2019-11-24 04:32:25,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:25,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027719972] [2019-11-24 04:32:25,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:25,119 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:25,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027719972] [2019-11-24 04:32:25,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:25,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:25,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069056194] [2019-11-24 04:32:25,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:25,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:25,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:25,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:25,121 INFO L87 Difference]: Start difference. First operand 272 states and 322 transitions. Second operand 3 states. [2019-11-24 04:32:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:25,239 INFO L93 Difference]: Finished difference Result 300 states and 350 transitions. [2019-11-24 04:32:25,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:25,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 04:32:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:25,240 INFO L225 Difference]: With dead ends: 300 [2019-11-24 04:32:25,241 INFO L226 Difference]: Without dead ends: 259 [2019-11-24 04:32:25,241 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:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-24 04:32:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2019-11-24 04:32:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-24 04:32:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 298 transitions. [2019-11-24 04:32:25,276 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 298 transitions. Word has length 26 [2019-11-24 04:32:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:25,276 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 298 transitions. [2019-11-24 04:32:25,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 298 transitions. [2019-11-24 04:32:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:32:25,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:25,278 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:25,278 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1017708459, now seen corresponding path program 1 times [2019-11-24 04:32:25,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:25,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060630081] [2019-11-24 04:32:25,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:25,328 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:25,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060630081] [2019-11-24 04:32:25,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:25,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:25,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965347877] [2019-11-24 04:32:25,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:25,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:25,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:25,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:25,331 INFO L87 Difference]: Start difference. First operand 251 states and 298 transitions. Second operand 4 states. [2019-11-24 04:32:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:25,479 INFO L93 Difference]: Finished difference Result 259 states and 305 transitions. [2019-11-24 04:32:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:25,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-24 04:32:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:25,481 INFO L225 Difference]: With dead ends: 259 [2019-11-24 04:32:25,481 INFO L226 Difference]: Without dead ends: 256 [2019-11-24 04:32:25,481 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:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-24 04:32:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2019-11-24 04:32:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-24 04:32:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 300 transitions. [2019-11-24 04:32:25,507 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 300 transitions. Word has length 27 [2019-11-24 04:32:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:25,507 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 300 transitions. [2019-11-24 04:32:25,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 300 transitions. [2019-11-24 04:32:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:32:25,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:25,508 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:25,509 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1017720375, now seen corresponding path program 1 times [2019-11-24 04:32:25,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:25,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969490399] [2019-11-24 04:32:25,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:25,571 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:25,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969490399] [2019-11-24 04:32:25,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:25,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:25,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266491332] [2019-11-24 04:32:25,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:25,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:25,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:25,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:25,572 INFO L87 Difference]: Start difference. First operand 253 states and 300 transitions. Second operand 5 states. [2019-11-24 04:32:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:25,770 INFO L93 Difference]: Finished difference Result 282 states and 326 transitions. [2019-11-24 04:32:25,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:25,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-24 04:32:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:25,772 INFO L225 Difference]: With dead ends: 282 [2019-11-24 04:32:25,772 INFO L226 Difference]: Without dead ends: 253 [2019-11-24 04:32:25,772 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:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-24 04:32:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 234. [2019-11-24 04:32:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-24 04:32:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2019-11-24 04:32:25,793 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 27 [2019-11-24 04:32:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:25,793 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2019-11-24 04:32:25,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2019-11-24 04:32:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:32:25,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:25,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:25,795 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:25,795 INFO L82 PathProgramCache]: Analyzing trace with hash 475837642, now seen corresponding path program 1 times [2019-11-24 04:32:25,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:25,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194417694] [2019-11-24 04:32:25,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:25,837 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:25,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194417694] [2019-11-24 04:32:25,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:25,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:25,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682513524] [2019-11-24 04:32:25,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:25,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:25,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:25,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:25,839 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 5 states. [2019-11-24 04:32:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:26,050 INFO L93 Difference]: Finished difference Result 264 states and 313 transitions. [2019-11-24 04:32:26,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:26,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-24 04:32:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:26,052 INFO L225 Difference]: With dead ends: 264 [2019-11-24 04:32:26,052 INFO L226 Difference]: Without dead ends: 262 [2019-11-24 04:32:26,052 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:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-24 04:32:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 234. [2019-11-24 04:32:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-24 04:32:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2019-11-24 04:32:26,075 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 28 [2019-11-24 04:32:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:26,075 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2019-11-24 04:32:26,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2019-11-24 04:32:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:32:26,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:26,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:26,076 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:26,077 INFO L82 PathProgramCache]: Analyzing trace with hash 936222207, now seen corresponding path program 1 times [2019-11-24 04:32:26,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:26,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523923028] [2019-11-24 04:32:26,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:26,113 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:26,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523923028] [2019-11-24 04:32:26,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:26,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:26,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412828291] [2019-11-24 04:32:26,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:26,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:26,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:26,115 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 5 states. [2019-11-24 04:32:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:26,191 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2019-11-24 04:32:26,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:26,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-24 04:32:26,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:26,193 INFO L225 Difference]: With dead ends: 248 [2019-11-24 04:32:26,193 INFO L226 Difference]: Without dead ends: 233 [2019-11-24 04:32:26,194 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:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-24 04:32:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-11-24 04:32:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-24 04:32:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2019-11-24 04:32:26,217 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 29 [2019-11-24 04:32:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:26,218 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2019-11-24 04:32:26,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2019-11-24 04:32:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:32:26,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:26,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:26,219 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:26,219 INFO L82 PathProgramCache]: Analyzing trace with hash 709739975, now seen corresponding path program 1 times [2019-11-24 04:32:26,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:26,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641714248] [2019-11-24 04:32:26,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:26,272 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:26,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641714248] [2019-11-24 04:32:26,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:26,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:26,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072926437] [2019-11-24 04:32:26,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:26,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:26,274 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 5 states. [2019-11-24 04:32:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:26,334 INFO L93 Difference]: Finished difference Result 285 states and 330 transitions. [2019-11-24 04:32:26,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:26,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-24 04:32:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:26,336 INFO L225 Difference]: With dead ends: 285 [2019-11-24 04:32:26,336 INFO L226 Difference]: Without dead ends: 259 [2019-11-24 04:32:26,336 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:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-24 04:32:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 233. [2019-11-24 04:32:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-24 04:32:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2019-11-24 04:32:26,376 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 29 [2019-11-24 04:32:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:26,376 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2019-11-24 04:32:26,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2019-11-24 04:32:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:32:26,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:26,377 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:26,377 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:26,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash -866894526, now seen corresponding path program 1 times [2019-11-24 04:32:26,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:26,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790907555] [2019-11-24 04:32:26,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:26,429 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:26,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790907555] [2019-11-24 04:32:26,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:26,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:26,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990362735] [2019-11-24 04:32:26,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:26,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:26,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:26,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:26,431 INFO L87 Difference]: Start difference. First operand 233 states and 276 transitions. Second operand 5 states. [2019-11-24 04:32:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:26,615 INFO L93 Difference]: Finished difference Result 254 states and 294 transitions. [2019-11-24 04:32:26,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:26,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-24 04:32:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:26,617 INFO L225 Difference]: With dead ends: 254 [2019-11-24 04:32:26,617 INFO L226 Difference]: Without dead ends: 235 [2019-11-24 04:32:26,618 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:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-24 04:32:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 225. [2019-11-24 04:32:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-24 04:32:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2019-11-24 04:32:26,645 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 30 [2019-11-24 04:32:26,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:26,646 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2019-11-24 04:32:26,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2019-11-24 04:32:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:32:26,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:26,647 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:26,647 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:26,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1005243574, now seen corresponding path program 1 times [2019-11-24 04:32:26,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:26,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184356750] [2019-11-24 04:32:26,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:26,697 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:26,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184356750] [2019-11-24 04:32:26,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:26,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:32:26,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593225440] [2019-11-24 04:32:26,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:32:26,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:32:26,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:32:26,699 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand 4 states. [2019-11-24 04:32:26,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:26,816 INFO L93 Difference]: Finished difference Result 267 states and 318 transitions. [2019-11-24 04:32:26,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:32:26,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-24 04:32:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:26,818 INFO L225 Difference]: With dead ends: 267 [2019-11-24 04:32:26,818 INFO L226 Difference]: Without dead ends: 261 [2019-11-24 04:32:26,818 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:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-24 04:32:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 211. [2019-11-24 04:32:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-24 04:32:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 252 transitions. [2019-11-24 04:32:26,843 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 252 transitions. Word has length 30 [2019-11-24 04:32:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:26,843 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 252 transitions. [2019-11-24 04:32:26,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:32:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 252 transitions. [2019-11-24 04:32:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:32:26,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:26,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, 1, 1, 1, 1] [2019-11-24 04:32:26,845 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:26,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:26,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1835927426, now seen corresponding path program 1 times [2019-11-24 04:32:26,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:26,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328876549] [2019-11-24 04:32:26,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:26,882 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:26,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328876549] [2019-11-24 04:32:26,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:26,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:26,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99740537] [2019-11-24 04:32:26,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:26,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:26,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:26,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:26,884 INFO L87 Difference]: Start difference. First operand 211 states and 252 transitions. Second operand 5 states. [2019-11-24 04:32:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:26,934 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2019-11-24 04:32:26,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:26,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-24 04:32:26,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:26,935 INFO L225 Difference]: With dead ends: 233 [2019-11-24 04:32:26,935 INFO L226 Difference]: Without dead ends: 183 [2019-11-24 04:32:26,936 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:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-24 04:32:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2019-11-24 04:32:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-24 04:32:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2019-11-24 04:32:26,954 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 31 [2019-11-24 04:32:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:26,954 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2019-11-24 04:32:26,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2019-11-24 04:32:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 04:32:26,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:26,955 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:26,956 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash 237508247, now seen corresponding path program 1 times [2019-11-24 04:32:26,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:26,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927690525] [2019-11-24 04:32:26,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:27,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927690525] [2019-11-24 04:32:27,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:27,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:27,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702799482] [2019-11-24 04:32:27,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:27,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:27,079 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand 6 states. [2019-11-24 04:32:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:27,261 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2019-11-24 04:32:27,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:27,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-24 04:32:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:27,262 INFO L225 Difference]: With dead ends: 187 [2019-11-24 04:32:27,262 INFO L226 Difference]: Without dead ends: 121 [2019-11-24 04:32:27,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:32:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-24 04:32:27,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2019-11-24 04:32:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-24 04:32:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2019-11-24 04:32:27,277 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 33 [2019-11-24 04:32:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:27,277 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2019-11-24 04:32:27,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2019-11-24 04:32:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:32:27,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:27,278 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:27,281 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash -828840542, now seen corresponding path program 1 times [2019-11-24 04:32:27,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:27,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630025798] [2019-11-24 04:32:27,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:27,352 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:27,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630025798] [2019-11-24 04:32:27,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:27,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:32:27,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419854239] [2019-11-24 04:32:27,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:32:27,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:32:27,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:32:27,354 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand 7 states. [2019-11-24 04:32:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:27,623 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2019-11-24 04:32:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:32:27,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-24 04:32:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:27,625 INFO L225 Difference]: With dead ends: 144 [2019-11-24 04:32:27,625 INFO L226 Difference]: Without dead ends: 142 [2019-11-24 04:32:27,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:32:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-24 04:32:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2019-11-24 04:32:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-24 04:32:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2019-11-24 04:32:27,640 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 36 [2019-11-24 04:32:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:27,640 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2019-11-24 04:32:27,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:32:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2019-11-24 04:32:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:32:27,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:27,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:27,642 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash -434854185, now seen corresponding path program 1 times [2019-11-24 04:32:27,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:27,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014115973] [2019-11-24 04:32:27,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:27,721 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:27,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014115973] [2019-11-24 04:32:27,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:27,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:27,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758083214] [2019-11-24 04:32:27,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:27,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:27,723 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand 5 states. [2019-11-24 04:32:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:27,848 INFO L93 Difference]: Finished difference Result 138 states and 170 transitions. [2019-11-24 04:32:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:27,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-24 04:32:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:27,850 INFO L225 Difference]: With dead ends: 138 [2019-11-24 04:32:27,850 INFO L226 Difference]: Without dead ends: 136 [2019-11-24 04:32:27,850 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:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-24 04:32:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2019-11-24 04:32:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-24 04:32:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-11-24 04:32:27,863 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 39 [2019-11-24 04:32:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:27,863 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-11-24 04:32:27,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-11-24 04:32:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:32:27,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:27,864 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:27,865 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2131118984, now seen corresponding path program 1 times [2019-11-24 04:32:27,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:27,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900632835] [2019-11-24 04:32:27,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:27,902 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:27,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900632835] [2019-11-24 04:32:27,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:27,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:27,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71033438] [2019-11-24 04:32:27,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:27,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:27,904 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 6 states. [2019-11-24 04:32:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:27,991 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2019-11-24 04:32:27,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:27,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-24 04:32:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:27,992 INFO L225 Difference]: With dead ends: 107 [2019-11-24 04:32:27,992 INFO L226 Difference]: Without dead ends: 91 [2019-11-24 04:32:27,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:32:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-24 04:32:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-24 04:32:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-24 04:32:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2019-11-24 04:32:28,005 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 40 [2019-11-24 04:32:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:28,005 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2019-11-24 04:32:28,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2019-11-24 04:32:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:32:28,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:28,006 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:28,007 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash 773342070, now seen corresponding path program 1 times [2019-11-24 04:32:28,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:28,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386048018] [2019-11-24 04:32:28,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:28,063 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:28,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386048018] [2019-11-24 04:32:28,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:28,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:32:28,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628975294] [2019-11-24 04:32:28,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:32:28,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:32:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:32:28,065 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand 7 states. [2019-11-24 04:32:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:28,174 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2019-11-24 04:32:28,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:28,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-24 04:32:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:28,175 INFO L225 Difference]: With dead ends: 132 [2019-11-24 04:32:28,175 INFO L226 Difference]: Without dead ends: 91 [2019-11-24 04:32:28,176 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:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-24 04:32:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-24 04:32:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-24 04:32:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2019-11-24 04:32:28,188 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 40 [2019-11-24 04:32:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:28,188 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-11-24 04:32:28,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:32:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2019-11-24 04:32:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:32:28,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:28,189 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] [2019-11-24 04:32:28,189 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1443434369, now seen corresponding path program 1 times [2019-11-24 04:32:28,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:28,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828278958] [2019-11-24 04:32:28,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:28,220 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:28,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828278958] [2019-11-24 04:32:28,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:28,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:32:28,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48984498] [2019-11-24 04:32:28,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:32:28,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:32:28,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:32:28,221 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 3 states. [2019-11-24 04:32:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:28,248 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2019-11-24 04:32:28,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:32:28,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 04:32:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:28,250 INFO L225 Difference]: With dead ends: 165 [2019-11-24 04:32:28,250 INFO L226 Difference]: Without dead ends: 119 [2019-11-24 04:32:28,250 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:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-24 04:32:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-11-24 04:32:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-24 04:32:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-24 04:32:28,263 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 43 [2019-11-24 04:32:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:28,263 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-24 04:32:28,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:32:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-11-24 04:32:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:32:28,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:28,264 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] [2019-11-24 04:32:28,265 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1535193216, now seen corresponding path program 1 times [2019-11-24 04:32:28,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:28,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393290083] [2019-11-24 04:32:28,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:28,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393290083] [2019-11-24 04:32:28,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:28,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711485879] [2019-11-24 04:32:28,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:28,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:28,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:28,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:28,307 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 6 states. [2019-11-24 04:32:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:28,384 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-11-24 04:32:28,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:32:28,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-24 04:32:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:28,385 INFO L225 Difference]: With dead ends: 105 [2019-11-24 04:32:28,385 INFO L226 Difference]: Without dead ends: 67 [2019-11-24 04:32:28,385 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:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-24 04:32:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-24 04:32:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-24 04:32:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-11-24 04:32:28,396 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 43 [2019-11-24 04:32:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:28,397 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-11-24 04:32:28,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-11-24 04:32:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:32:28,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:28,397 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:28,398 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1844532147, now seen corresponding path program 1 times [2019-11-24 04:32:28,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:28,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359635290] [2019-11-24 04:32:28,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:32:28,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359635290] [2019-11-24 04:32:28,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:28,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:28,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896217279] [2019-11-24 04:32:28,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:28,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:28,455 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 6 states. [2019-11-24 04:32:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:28,554 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2019-11-24 04:32:28,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:28,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-24 04:32:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:28,555 INFO L225 Difference]: With dead ends: 87 [2019-11-24 04:32:28,555 INFO L226 Difference]: Without dead ends: 69 [2019-11-24 04:32:28,556 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:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-24 04:32:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-24 04:32:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 04:32:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-11-24 04:32:28,600 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 49 [2019-11-24 04:32:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:28,601 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-11-24 04:32:28,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-11-24 04:32:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 04:32:28,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:28,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:28,602 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1302378184, now seen corresponding path program 1 times [2019-11-24 04:32:28,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:28,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349373559] [2019-11-24 04:32:28,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:28,659 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:28,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349373559] [2019-11-24 04:32:28,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:28,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:32:28,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237834764] [2019-11-24 04:32:28,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:32:28,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:28,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:32:28,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:32:28,661 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 6 states. [2019-11-24 04:32:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:28,751 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-11-24 04:32:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:32:28,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-24 04:32:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:28,752 INFO L225 Difference]: With dead ends: 87 [2019-11-24 04:32:28,752 INFO L226 Difference]: Without dead ends: 66 [2019-11-24 04:32:28,752 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:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-24 04:32:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-24 04:32:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-24 04:32:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-11-24 04:32:28,764 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 52 [2019-11-24 04:32:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:28,764 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-11-24 04:32:28,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:32:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-11-24 04:32:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 04:32:28,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:28,765 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:28,766 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:28,766 INFO L82 PathProgramCache]: Analyzing trace with hash -948000753, now seen corresponding path program 1 times [2019-11-24 04:32:28,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:28,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593591607] [2019-11-24 04:32:28,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:28,896 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:28,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593591607] [2019-11-24 04:32:28,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:28,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:32:28,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965666074] [2019-11-24 04:32:28,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:32:28,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:32:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:32:28,898 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 9 states. [2019-11-24 04:32:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:29,190 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-11-24 04:32:29,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:32:29,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-24 04:32:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:29,191 INFO L225 Difference]: With dead ends: 92 [2019-11-24 04:32:29,191 INFO L226 Difference]: Without dead ends: 66 [2019-11-24 04:32:29,191 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:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-24 04:32:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-24 04:32:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-24 04:32:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-24 04:32:29,203 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 54 [2019-11-24 04:32:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:29,203 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-24 04:32:29,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:32:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-24 04:32:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 04:32:29,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:29,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:32:29,204 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:29,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1192472812, now seen corresponding path program 1 times [2019-11-24 04:32:29,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:29,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016416547] [2019-11-24 04:32:29,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:29,274 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:29,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016416547] [2019-11-24 04:32:29,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:29,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:32:29,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908574769] [2019-11-24 04:32:29,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:32:29,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:29,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:32:29,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:32:29,275 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-11-24 04:32:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:29,346 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-11-24 04:32:29,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:32:29,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-24 04:32:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:29,347 INFO L225 Difference]: With dead ends: 96 [2019-11-24 04:32:29,348 INFO L226 Difference]: Without dead ends: 67 [2019-11-24 04:32:29,348 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:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-24 04:32:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-11-24 04:32:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 04:32:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-24 04:32:29,362 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2019-11-24 04:32:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:29,362 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-24 04:32:29,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:32:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-24 04:32:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 04:32:29,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:32:29,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,363 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:32:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:32:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash -574628619, now seen corresponding path program 1 times [2019-11-24 04:32:29,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:32:29,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394712883] [2019-11-24 04:32:29,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:32:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:32:29,527 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:29,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394712883] [2019-11-24 04:32:29,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:32:29,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:32:29,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981825489] [2019-11-24 04:32:29,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:32:29,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:32:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:32:29,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:32:29,529 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 9 states. [2019-11-24 04:32:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:32:29,701 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-24 04:32:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:32:29,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-11-24 04:32:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:32:29,702 INFO L225 Difference]: With dead ends: 79 [2019-11-24 04:32:29,702 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:32:29,703 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:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:32:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:32:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:32:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:32:29,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-24 04:32:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:32:29,704 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:32:29,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:32:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:32:29,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:32:29,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:32:29,936 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 133 [2019-11-24 04:32:30,404 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 134 [2019-11-24 04:32:31,031 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 270 [2019-11-24 04:32:31,606 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2019-11-24 04:32:31,777 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-11-24 04:32:31,946 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-11-24 04:32:32,718 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-11-24 04:32:32,879 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-11-24 04:32:33,036 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-11-24 04:32:33,260 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-11-24 04:32:33,438 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-11-24 04:32:33,948 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-11-24 04:32:34,449 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-11-24 04:32:34,768 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-11-24 04:32:35,059 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-11-24 04:32:35,283 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-11-24 04:32:35,853 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2019-11-24 04:32:36,028 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-11-24 04:32:36,304 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-11-24 04:32:36,939 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 80 [2019-11-24 04:32:37,312 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-11-24 04:32:37,544 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-11-24 04:32:38,033 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2019-11-24 04:32:39,117 WARN L192 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 249 DAG size of output: 149 [2019-11-24 04:32:39,268 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2019-11-24 04:32:39,445 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-11-24 04:32:40,531 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 234 DAG size of output: 144 [2019-11-24 04:32:41,076 WARN L192 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-11-24 04:32:42,247 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 243 DAG size of output: 151 [2019-11-24 04:32:42,929 WARN L192 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2019-11-24 04:32:43,270 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-11-24 04:32:43,463 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-11-24 04:32:44,155 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-11-24 04:32:44,595 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-24 04:32:46,178 WARN L192 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 269 DAG size of output: 145 [2019-11-24 04:32:46,358 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-11-24 04:32:46,803 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-11-24 04:32:47,564 WARN L192 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 102 [2019-11-24 04:32:47,673 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-11-24 04:32:47,838 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-11-24 04:32:48,106 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-11-24 04:32:48,444 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-24 04:32:48,860 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-24 04:32:49,103 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-11-24 04:32:49,122 INFO L444 ceAbstractionStarter]: For program point L234-1(lines 227 415) no Hoare annotation was computed. [2019-11-24 04:32:49,122 INFO L444 ceAbstractionStarter]: For program point L1295(lines 1295 1309) no Hoare annotation was computed. [2019-11-24 04:32:49,122 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-11-24 04:32:49,123 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 640) no Hoare annotation was computed. [2019-11-24 04:32:49,123 INFO L444 ceAbstractionStarter]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2019-11-24 04:32:49,123 INFO L440 ceAbstractionStarter]: At program point L1560(lines 1181 1562) the Hoare annotation is: (let ((.cse5 (+ ~s~0 5))) (let ((.cse0 (= 1 ~pended~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= .cse5 ~IPC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= ~s~0 ~NP~0) .cse2 .cse3 (<= .cse5 ~MPR3~0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) (<= (+ ~DC~0 5) ~IPC~0) .cse6 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) .cse7 .cse3 .cse8 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse1 .cse9) (and .cse6 .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse10 .cse3 .cse4 .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse1 .cse9 (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|))) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse1 .cse6 .cse2 .cse3 .cse4) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse1 .cse6 .cse2 .cse9 .cse10 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0))))) [2019-11-24 04:32:49,123 INFO L444 ceAbstractionStarter]: For program point L1296(lines 1296 1302) no Hoare annotation was computed. [2019-11-24 04:32:49,124 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-11-24 04:32:49,124 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-11-24 04:32:49,124 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,124 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,124 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-11-24 04:32:49,124 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,124 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,125 INFO L440 ceAbstractionStarter]: At program point L642(lines 610 644) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= ~myStatus~0 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (= 1 ~compRegistered~0)) (.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)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-11-24 04:32:49,125 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,125 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 515) no Hoare annotation was computed. [2019-11-24 04:32:49,125 INFO L440 ceAbstractionStarter]: At program point L510-2(lines 510 515) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-11-24 04:32:49,125 INFO L440 ceAbstractionStarter]: At program point L116(lines 116 146) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,125 INFO L444 ceAbstractionStarter]: For program point L116-2(lines 108 156) no Hoare annotation was computed. [2019-11-24 04:32:49,126 INFO L444 ceAbstractionStarter]: For program point L1041(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,126 INFO L440 ceAbstractionStarter]: At program point L116-3(lines 116 146) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,126 INFO L444 ceAbstractionStarter]: For program point L1041-2(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,126 INFO L444 ceAbstractionStarter]: For program point L116-5(lines 108 156) no Hoare annotation was computed. [2019-11-24 04:32:49,126 INFO L444 ceAbstractionStarter]: For program point L1041-4(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,126 INFO L444 ceAbstractionStarter]: For program point L1041-6(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,126 INFO L444 ceAbstractionStarter]: For program point L1041-8(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,126 INFO L444 ceAbstractionStarter]: For program point L1041-10(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,127 INFO L444 ceAbstractionStarter]: For program point L1041-12(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,127 INFO L444 ceAbstractionStarter]: For program point L1041-14(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,127 INFO L444 ceAbstractionStarter]: For program point L1041-16(lines 1041 1047) no Hoare annotation was computed. [2019-11-24 04:32:49,127 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 783) no Hoare annotation was computed. [2019-11-24 04:32:49,127 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,127 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,127 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,128 INFO L440 ceAbstractionStarter]: At program point L785(lines 778 833) the Hoare annotation is: (let ((.cse21 (+ ~DC~0 2))) (let ((.cse3 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= ULTIMATE.start_main_~status~1 0)) (.cse11 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse13 (<= .cse21 ~s~0)) (.cse17 (= 1 ~pended~0)) (.cse14 (<= (+ ~DC~0 5) ~IPC~0)) (.cse18 (= 0 ~compRegistered~0)) (.cse15 (= ~SKIP2~0 ~s~0)) (.cse19 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse16 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse20 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse12 (<= .cse21 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~myStatus~0 0) .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse10 .cse1 .cse12 .cse4 .cse5 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse13 .cse14 .cse1 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse2 .cse15 .cse6 .cse16 .cse8 .cse9 .cse10) (and .cse17 .cse14 .cse10 .cse18 .cse12 (= ~IPC~0 ~s~0)) (and .cse1 (= ULTIMATE.start_main_~status~1 0) .cse5) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 .cse1 .cse19 .cse5) (and .cse17 .cse10 .cse18 .cse5) (and .cse0 .cse13 .cse14 .cse1 .cse2 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse15 .cse6 .cse16 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse12 (not (= ULTIMATE.start_main_~status~1 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and .cse0 .cse17 .cse14 .cse10 .cse18 .cse12 .cse15 .cse6 .cse8) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse10 .cse1 .cse19 .cse5) (and .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse4 .cse5 .cse6 .cse16 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse10 .cse20 .cse12 (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|))) (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)) .cse4 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse5 .cse6 .cse8 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse9 .cse10 .cse20 .cse12 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)))))) [2019-11-24 04:32:49,128 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,128 INFO L440 ceAbstractionStarter]: At program point L1314(lines 1314 1548) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,128 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,128 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 289) no Hoare annotation was computed. [2019-11-24 04:32:49,128 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2019-11-24 04:32:49,129 INFO L440 ceAbstractionStarter]: At program point L127(lines 127 134) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,129 INFO L440 ceAbstractionStarter]: At program point L127-1(lines 127 134) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,129 INFO L444 ceAbstractionStarter]: For program point L1450(lines 1450 1453) no Hoare annotation was computed. [2019-11-24 04:32:49,129 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 591) no Hoare annotation was computed. [2019-11-24 04:32:49,129 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 526 591) no Hoare annotation was computed. [2019-11-24 04:32:49,129 INFO L440 ceAbstractionStarter]: At program point L1319(lines 1319 1546) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,129 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,129 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 568) no Hoare annotation was computed. [2019-11-24 04:32:49,130 INFO L440 ceAbstractionStarter]: At program point L793(lines 786 832) the Hoare annotation is: (let ((.cse4 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse13 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse14 (= 1 ~pended~0)) (.cse15 (<= (+ ~DC~0 5) ~IPC~0)) (.cse16 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse2 (<= (+ ~s~0 5) ~IPC~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (= ~s~0 ~DC~0))) (or (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse0 .cse4 .cse3) (and .cse5 .cse6 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse2 .cse7 .cse8 .cse3 .cse9 .cse10 .cse11 .cse0 .cse12 .cse1) (and .cse5 (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)) .cse6 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse2 .cse8 .cse3 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse10 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse11 .cse0 .cse1 .cse13 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse14 .cse0 .cse3) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse0 .cse4 .cse3) (and .cse5 .cse14 .cse15 .cse0 .cse1 .cse16 .cse8 .cse10) (and (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse13 .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse2 .cse8 .cse3 (<= (+ ~NP~0 4) ~MPR1~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|)) .cse10) (and .cse5 .cse6 .cse2 .cse7 .cse8 .cse3 .cse9 (<= ~myStatus~0 0) .cse10 .cse11 .cse0 .cse12 .cse1) (and .cse14 .cse15 .cse0 .cse1 (= ~IPC~0 ~s~0)) (and .cse5 .cse15 .cse6 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse16 .cse8 .cse10 .cse11 .cse0 .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse11 .cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse15 .cse0 .cse6 .cse1 .cse16 .cse8 .cse10) (and .cse5 .cse6 .cse2 .cse8 .cse3 .cse10 .cse11 .cse0 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse1 (not (= ULTIMATE.start_main_~status~1 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and (= ULTIMATE.start_main_~status~1 0) .cse3))) [2019-11-24 04:32:49,130 INFO L440 ceAbstractionStarter]: At program point L529(lines 529 539) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (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 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16)))) [2019-11-24 04:32:49,131 INFO L447 ceAbstractionStarter]: At program point L794(lines 778 833) the Hoare annotation is: true [2019-11-24 04:32:49,131 INFO L440 ceAbstractionStarter]: At program point L662(lines 722 724) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~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:49,131 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 830) no Hoare annotation was computed. [2019-11-24 04:32:49,131 INFO L444 ceAbstractionStarter]: For program point L796(lines 796 829) no Hoare annotation was computed. [2019-11-24 04:32:49,131 INFO L444 ceAbstractionStarter]: For program point L1589-2(lines 1587 1618) no Hoare annotation was computed. [2019-11-24 04:32:49,131 INFO L444 ceAbstractionStarter]: For program point L797(lines 797 807) no Hoare annotation was computed. [2019-11-24 04:32:49,131 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,131 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 275) no Hoare annotation was computed. [2019-11-24 04:32:49,131 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,132 INFO L444 ceAbstractionStarter]: For program point L798(lines 798 804) no Hoare annotation was computed. [2019-11-24 04:32:49,132 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,132 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,132 INFO L440 ceAbstractionStarter]: At program point L1592-1(lines 1592 1616) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse2 (+ ~s~0 5)) (.cse1 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) (= ~s~0 ~NP~0) .cse0 .cse1 (<= .cse2 ~MPR3~0)) (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse0 (<= (+ ~DC~0 2) ~SKIP2~0) (<= .cse2 ~IPC~0) .cse1 (= ~s~0 ~DC~0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)))) [2019-11-24 04:32:49,132 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1480) no Hoare annotation was computed. [2019-11-24 04:32:49,132 INFO L444 ceAbstractionStarter]: For program point L1328(lines 1328 1544) no Hoare annotation was computed. [2019-11-24 04:32:49,132 INFO L444 ceAbstractionStarter]: For program point L1064(lines 1064 1083) no Hoare annotation was computed. [2019-11-24 04:32:49,132 INFO L444 ceAbstractionStarter]: For program point L1064-1(lines 1064 1083) no Hoare annotation was computed. [2019-11-24 04:32:49,132 INFO L444 ceAbstractionStarter]: For program point L1064-2(lines 1064 1083) no Hoare annotation was computed. [2019-11-24 04:32:49,133 INFO L444 ceAbstractionStarter]: For program point L1064-3(lines 1064 1083) no Hoare annotation was computed. [2019-11-24 04:32:49,133 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1464) no Hoare annotation was computed. [2019-11-24 04:32:49,133 INFO L444 ceAbstractionStarter]: For program point L1065(lines 1065 1070) no Hoare annotation was computed. [2019-11-24 04:32:49,133 INFO L444 ceAbstractionStarter]: For program point L1065-2(lines 1065 1070) no Hoare annotation was computed. [2019-11-24 04:32:49,133 INFO L444 ceAbstractionStarter]: For program point L1065-4(lines 1065 1070) no Hoare annotation was computed. [2019-11-24 04:32:49,133 INFO L444 ceAbstractionStarter]: For program point L1065-6(lines 1065 1070) no Hoare annotation was computed. [2019-11-24 04:32:49,133 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 144) no Hoare annotation was computed. [2019-11-24 04:32:49,133 INFO L444 ceAbstractionStarter]: For program point L142-1(lines 142 144) no Hoare annotation was computed. [2019-11-24 04:32:49,134 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,134 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,134 INFO L440 ceAbstractionStarter]: At program point L541(lines 528 568) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (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 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16)))) [2019-11-24 04:32:49,134 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1479) no Hoare annotation was computed. [2019-11-24 04:32:49,134 INFO L440 ceAbstractionStarter]: At program point L1072(lines 1064 1083) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (= 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) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (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:49,135 INFO L440 ceAbstractionStarter]: At program point L1072-1(lines 1064 1083) the Hoare annotation is: false [2019-11-24 04:32:49,135 INFO L440 ceAbstractionStarter]: At program point L1072-2(lines 1064 1083) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse0 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~s~0 5) ~MPR3~0) .cse6 .cse7) (and .cse0 (= 1 ~pended~0) .cse1 .cse2 (<= (+ ~NP~0 5) ~MPR3~0) .cse3 .cse4 .cse6 .cse5 .cse7))) [2019-11-24 04:32:49,135 INFO L440 ceAbstractionStarter]: At program point L1072-3(lines 1064 1083) 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) (<= ~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) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,135 INFO L444 ceAbstractionStarter]: For program point L1337(lines 1337 1542) no Hoare annotation was computed. [2019-11-24 04:32:49,136 INFO L440 ceAbstractionStarter]: At program point L809(lines 796 829) the Hoare annotation is: (let ((.cse17 (+ ~DC~0 2))) (let ((.cse2 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse12 (<= .cse17 ~s~0)) (.cse13 (<= (+ ~DC~0 5) ~IPC~0)) (.cse11 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse3 (<= (+ ~s~0 5) ~IPC~0)) (.cse14 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse15 (<= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse16 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse1 (<= .cse17 ~SKIP2~0)) (.cse4 (= ~s~0 ~DC~0))) (or (and (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse1 .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 .cse5 .cse6 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) .cse7 (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|))) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse0 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse1 (not (= ULTIMATE.start_main_~status~1 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse0 .cse11 .cse4) (and .cse8 .cse12 .cse13 .cse9 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse5 .cse7 .cse10 .cse0 .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse8 (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)) .cse9 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse3 .cse4 .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse6 .cse7 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse10 .cse0 .cse1 .cse2 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (= 1 ~pended~0) .cse0) (and .cse10 .cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse12 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse13 .cse0 .cse9 .cse1 .cse5 .cse7) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse0 .cse11 .cse4) (and .cse8 .cse9 .cse3 .cse14 .cse4 .cse5 .cse15 (<= ~myStatus~0 0) .cse6 .cse7 .cse10 .cse0 .cse16 .cse1) (and .cse8 .cse9 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse7 .cse10 .cse0 .cse16 .cse1) (and (= ULTIMATE.start_main_~status~1 0) .cse4)))) [2019-11-24 04:32:49,136 INFO L444 ceAbstractionStarter]: For program point L1470(lines 1470 1478) no Hoare annotation was computed. [2019-11-24 04:32:49,136 INFO L440 ceAbstractionStarter]: At program point L1338(lines 1328 1544) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,136 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,136 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,137 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,137 INFO L440 ceAbstractionStarter]: At program point L548-2(lines 548 564) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (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 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16)))) [2019-11-24 04:32:49,137 INFO L440 ceAbstractionStarter]: At program point L416(lines 227 417) the Hoare annotation is: (let ((.cse11 (= 1 ~pended~0)) (.cse13 (= 0 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (<= (+ ~s~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse7 (= ~s~0 ~DC~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse12 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (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 .cse3 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse10 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse11 .cse12 .cse10 .cse13 .cse14 .cse6 (= ~IPC~0 ~s~0)) (and .cse11 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse12 .cse10 .cse13 .cse14 .cse16 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 (<= ~myStatus~0 0) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse12 .cse1 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse14))) [2019-11-24 04:32:49,138 INFO L444 ceAbstractionStarter]: For program point L1077(lines 1077 1081) no Hoare annotation was computed. [2019-11-24 04:32:49,138 INFO L440 ceAbstractionStarter]: At program point L1077-1(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-11-24 04:32:49,138 INFO L444 ceAbstractionStarter]: For program point L1077-2(lines 1077 1081) no Hoare annotation was computed. [2019-11-24 04:32:49,138 INFO L440 ceAbstractionStarter]: At program point L1077-3(lines 1077 1081) 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)) (<= (+ ~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) (= 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)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-11-24 04:32:49,138 INFO L444 ceAbstractionStarter]: For program point L1077-4(lines 1077 1081) no Hoare annotation was computed. [2019-11-24 04:32:49,138 INFO L440 ceAbstractionStarter]: At program point L1077-5(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse0 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse1 .cse2 (= 0 ~pended~0) .cse3 .cse4 .cse5 (<= (+ ~s~0 5) ~MPR3~0) .cse6 .cse7) (and .cse0 (= 1 ~pended~0) .cse2 .cse1 (<= (+ ~NP~0 5) ~MPR3~0) .cse3 .cse4 .cse6 .cse5 .cse7))) [2019-11-24 04:32:49,139 INFO L444 ceAbstractionStarter]: For program point L1077-6(lines 1077 1081) no Hoare annotation was computed. [2019-11-24 04:32:49,139 INFO L440 ceAbstractionStarter]: At program point L1077-7(lines 1077 1081) 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) (<= ~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) (= 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) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-11-24 04:32:49,139 INFO L440 ceAbstractionStarter]: At program point L549(lines 548 564) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (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 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16)))) [2019-11-24 04:32:49,139 INFO L444 ceAbstractionStarter]: For program point L1474(lines 1474 1477) no Hoare annotation was computed. [2019-11-24 04:32:49,140 INFO L444 ceAbstractionStarter]: For program point L815(lines 815 827) no Hoare annotation was computed. [2019-11-24 04:32:49,140 INFO L444 ceAbstractionStarter]: For program point L1608(lines 1608 1614) no Hoare annotation was computed. [2019-11-24 04:32:49,140 INFO L440 ceAbstractionStarter]: At program point L155(lines 95 157) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 (<= (+ ~s~0 5) ~MPR3~0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 (<= (+ ~NP~0 5) ~MPR3~0) .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) .cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))))) [2019-11-24 04:32:49,140 INFO L440 ceAbstractionStarter]: At program point L155-1(lines 95 157) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse0 (= 1 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse1 (= 0 ~pended~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8))) [2019-11-24 04:32:49,140 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 820) no Hoare annotation was computed. [2019-11-24 04:32:49,140 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,141 INFO L444 ceAbstractionStarter]: For program point L1346(lines 1346 1540) no Hoare annotation was computed. [2019-11-24 04:32:49,141 INFO L440 ceAbstractionStarter]: At program point L1482(lines 1346 1540) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,141 INFO L444 ceAbstractionStarter]: For program point L293-1(lines 227 415) no Hoare annotation was computed. [2019-11-24 04:32:49,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,141 INFO L444 ceAbstractionStarter]: For program point L954(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,141 INFO L444 ceAbstractionStarter]: For program point L954-2(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,141 INFO L444 ceAbstractionStarter]: For program point L954-4(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 826) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L954-6(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L954-8(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L954-10(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L954-12(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L954-14(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L954-16(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L954-18(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point L954-20(lines 954 960) no Hoare annotation was computed. [2019-11-24 04:32:49,142 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,143 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,143 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 562) no Hoare annotation was computed. [2019-11-24 04:32:49,143 INFO L440 ceAbstractionStarter]: At program point L429(lines 158 431) the Hoare annotation is: (let ((.cse13 (= 1 ~pended~0)) (.cse14 (<= (+ ~DC~0 5) ~IPC~0)) (.cse15 (= 0 ~compRegistered~0)) (.cse16 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse17 (= ~SKIP2~0 ~s~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse12 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~s~0 2) ~SKIP2~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse6 (<= (+ ~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)) (.cse1 (= 0 ~pended~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse11 .cse15 .cse16 .cse7 (= ~IPC~0 ~s~0)) (and .cse13 .cse11 .cse15 .cse7 .cse8) (and .cse0 .cse14 .cse1 .cse3 .cse17 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and .cse0 .cse13 .cse14 .cse11 .cse15 .cse16 .cse17 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~myStatus~0 0) .cse9 .cse10 .cse11 .cse12) (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 .cse3 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse9 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse10 .cse11 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse11 .cse1 .cse7 .cse8))) [2019-11-24 04:32:49,143 INFO L444 ceAbstractionStarter]: For program point L1355(lines 1355 1538) no Hoare annotation was computed. [2019-11-24 04:32:49,143 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 305) no Hoare annotation was computed. [2019-11-24 04:32:49,143 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,144 INFO L440 ceAbstractionStarter]: At program point L565(lines 526 591) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (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 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)))))) [2019-11-24 04:32:49,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,144 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1536) no Hoare annotation was computed. [2019-11-24 04:32:49,144 INFO L444 ceAbstractionStarter]: For program point L1625(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,144 INFO L444 ceAbstractionStarter]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,144 INFO L444 ceAbstractionStarter]: For program point L1625-2(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,144 INFO L444 ceAbstractionStarter]: For program point L1625-3(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-4(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-5(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-6(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-7(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-8(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-9(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-10(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-11(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-12(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,145 INFO L444 ceAbstractionStarter]: For program point L1625-13(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-14(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-15(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-16(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-17(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-18(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-19(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-20(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-21(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,146 INFO L444 ceAbstractionStarter]: For program point L1625-22(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-23(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-24(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-25(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-26(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-27(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-28(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-29(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-30(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,147 INFO L440 ceAbstractionStarter]: At program point L1626(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-24 04:32:49,147 INFO L444 ceAbstractionStarter]: For program point L1625-31(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,148 INFO L440 ceAbstractionStarter]: At program point L1626-1(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-24 04:32:49,148 INFO L444 ceAbstractionStarter]: For program point L1625-32(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,148 INFO L440 ceAbstractionStarter]: At program point L1626-2(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~s~0 5) ~IPC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-24 04:32:49,148 INFO L444 ceAbstractionStarter]: For program point L1625-33(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,148 INFO L440 ceAbstractionStarter]: At program point L1626-3(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-24 04:32:49,148 INFO L444 ceAbstractionStarter]: For program point L1625-34(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,148 INFO L440 ceAbstractionStarter]: At program point L1626-4(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-24 04:32:49,148 INFO L444 ceAbstractionStarter]: For program point L1625-35(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,149 INFO L440 ceAbstractionStarter]: At program point L1626-5(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,149 INFO L444 ceAbstractionStarter]: For program point L1625-36(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,149 INFO L444 ceAbstractionStarter]: For program point L1625-37(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,149 INFO L440 ceAbstractionStarter]: At program point L1626-7(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,149 INFO L444 ceAbstractionStarter]: For program point L1625-38(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,149 INFO L440 ceAbstractionStarter]: At program point L1626-8(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-11-24 04:32:49,149 INFO L444 ceAbstractionStarter]: For program point L1625-39(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,149 INFO L440 ceAbstractionStarter]: At program point L1626-9(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,150 INFO L444 ceAbstractionStarter]: For program point L1625-40(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,150 INFO L444 ceAbstractionStarter]: For program point L1625-41(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,150 INFO L440 ceAbstractionStarter]: At program point L1626-11(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,150 INFO L444 ceAbstractionStarter]: For program point L1625-42(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,150 INFO L444 ceAbstractionStarter]: For program point L1625-43(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,150 INFO L440 ceAbstractionStarter]: At program point L1626-13(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-11-24 04:32:49,150 INFO L444 ceAbstractionStarter]: For program point L1625-44(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,150 INFO L444 ceAbstractionStarter]: For program point L1625-45(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,150 INFO L444 ceAbstractionStarter]: For program point L1625-46(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,150 INFO L444 ceAbstractionStarter]: For program point L1625-47(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,151 INFO L440 ceAbstractionStarter]: At program point L1626-17(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or .cse0 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~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) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,151 INFO L444 ceAbstractionStarter]: For program point L1625-48(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,151 INFO L444 ceAbstractionStarter]: For program point L1625-49(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,151 INFO L444 ceAbstractionStarter]: For program point L1625-50(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,151 INFO L440 ceAbstractionStarter]: At program point L1626-20(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or .cse0 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~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) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,152 INFO L444 ceAbstractionStarter]: For program point L1625-51(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,152 INFO L444 ceAbstractionStarter]: For program point L1625-52(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,152 INFO L440 ceAbstractionStarter]: At program point L1626-22(lines 1037 1050) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse3 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (= ~s~0 ~DC~0)) (.cse7 (<= (+ .cse16 1) 0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (= 1 ~compRegistered~0)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .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)) (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)) .cse3 .cse15 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)))))) [2019-11-24 04:32:49,152 INFO L440 ceAbstractionStarter]: At program point L1626-23(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,152 INFO L440 ceAbstractionStarter]: At program point L1626-25(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,153 INFO L440 ceAbstractionStarter]: At program point L1626-26(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 1 ~pended~0) (<= (+ ~DC~0 5) ~IPC~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,153 INFO L440 ceAbstractionStarter]: At program point L1626-28(lines 1 1628) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~s~0 2) ~MPR1~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0))) (.cse7 (<= (+ ~NP~0 2) ~s~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse0 (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-24 04:32:49,153 INFO L440 ceAbstractionStarter]: At program point L1626-30(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse7 (= ~SKIP2~0 ~s~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0)) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse5 .cse9) (and .cse6 .cse1 (= 0 ~pended~0) .cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7 .cse8 .cse5 .cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse2 .cse4))) [2019-11-24 04:32:49,153 INFO L440 ceAbstractionStarter]: At program point L1626-32(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,153 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,154 INFO L440 ceAbstractionStarter]: At program point L1626-34(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,154 INFO L440 ceAbstractionStarter]: At program point L1626-38(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or .cse0 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~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) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or .cse0 (= ~MPR3~0 ~s~0)) (= 1 ~compRegistered~0) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,154 INFO L440 ceAbstractionStarter]: At program point L1626-41(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,154 INFO L440 ceAbstractionStarter]: At program point L1626-43(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,155 INFO L440 ceAbstractionStarter]: At program point L1626-44(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,155 INFO L440 ceAbstractionStarter]: At program point L1626-46(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,155 INFO L440 ceAbstractionStarter]: At program point L1626-47(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,155 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,155 INFO L440 ceAbstractionStarter]: At program point L1626-49(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,155 INFO L447 ceAbstractionStarter]: At program point L835(lines 665 837) the Hoare annotation is: true [2019-11-24 04:32:49,156 INFO L440 ceAbstractionStarter]: At program point L705(lines 699 836) the Hoare annotation is: (let ((.cse18 (+ ~s~0 5))) (let ((.cse3 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= ULTIMATE.start_main_~status~1 0)) (.cse11 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse15 (= 1 ~pended~0)) (.cse13 (<= (+ ~DC~0 5) ~IPC~0)) (.cse16 (= 0 ~compRegistered~0)) (.cse14 (= ~SKIP2~0 ~s~0)) (.cse17 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= .cse18 ~IPC~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse19 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~myStatus~0 0) .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse10 .cse1 .cse12 .cse4 .cse5 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse0 .cse13 .cse1 .cse2 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse14 .cse6 .cse8 .cse9 .cse10 .cse12 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse15 .cse13 .cse10 .cse16 .cse12 (= ~IPC~0 ~s~0)) (and .cse1 (= ULTIMATE.start_main_~status~1 0) .cse5) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 .cse1 .cse17 .cse5) (and .cse9 .cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse13 .cse10 .cse1 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse12 .cse2 .cse14 .cse6 .cse8) (and .cse15 .cse10 .cse16 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse12 (not (= ULTIMATE.start_main_~status~1 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and .cse15 (= ~s~0 ~NP~0) .cse16 (<= .cse18 ~MPR3~0)) (and .cse0 .cse15 .cse13 .cse10 .cse16 .cse12 .cse14 .cse6 .cse8) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse10 .cse1 .cse17 .cse5) (and .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse4 .cse5 .cse6 (<= (+ ~NP~0 4) ~MPR1~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse10 .cse19 .cse12 (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|))) (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)) .cse4 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse5 .cse6 .cse8 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse9 .cse10 .cse19 .cse12 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)))))) [2019-11-24 04:32:49,156 INFO L444 ceAbstractionStarter]: For program point L1367(lines 1367 1534) no Hoare annotation was computed. [2019-11-24 04:32:49,156 INFO L440 ceAbstractionStarter]: At program point L972(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,156 INFO L440 ceAbstractionStarter]: At program point L972-1(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,157 INFO L440 ceAbstractionStarter]: At program point L972-2(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,157 INFO L440 ceAbstractionStarter]: At program point L972-3(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,157 INFO L440 ceAbstractionStarter]: At program point L972-4(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~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)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0)) [2019-11-24 04:32:49,157 INFO L440 ceAbstractionStarter]: At program point L972-5(lines 972 984) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,157 INFO L440 ceAbstractionStarter]: At program point L972-6(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 1 ~compRegistered~0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,158 INFO L440 ceAbstractionStarter]: At program point L972-7(lines 972 984) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 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)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,158 INFO L440 ceAbstractionStarter]: At program point L972-8(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,158 INFO L440 ceAbstractionStarter]: At program point L972-9(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,158 INFO L440 ceAbstractionStarter]: At program point L972-10(lines 972 984) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~s~0 2) ~MPR1~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0))) (.cse7 (<= (+ ~NP~0 2) ~s~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse0 (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-24 04:32:49,158 INFO L440 ceAbstractionStarter]: At program point L972-11(lines 972 984) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~s~0 2) ~MPR1~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0))) (.cse7 (<= (+ ~NP~0 2) ~s~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse0 (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-24 04:32:49,159 INFO L440 ceAbstractionStarter]: At program point L972-12(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,159 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,159 INFO L440 ceAbstractionStarter]: At program point L972-13(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,159 INFO L440 ceAbstractionStarter]: At program point L972-14(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~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)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0)) [2019-11-24 04:32:49,159 INFO L440 ceAbstractionStarter]: At program point L972-15(lines 972 984) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,160 INFO L440 ceAbstractionStarter]: At program point L972-16(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,160 INFO L440 ceAbstractionStarter]: At program point L972-17(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,160 INFO L440 ceAbstractionStarter]: At program point L972-18(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,160 INFO L440 ceAbstractionStarter]: At program point L972-19(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,160 INFO L440 ceAbstractionStarter]: At program point L972-20(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,161 INFO L440 ceAbstractionStarter]: At program point L972-21(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,161 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,161 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,161 INFO L444 ceAbstractionStarter]: For program point L1374(lines 1374 1532) no Hoare annotation was computed. [2019-11-24 04:32:49,161 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 329) no Hoare annotation was computed. [2019-11-24 04:32:49,161 INFO L444 ceAbstractionStarter]: For program point L978(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,161 INFO L444 ceAbstractionStarter]: For program point L978-2(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,161 INFO L444 ceAbstractionStarter]: For program point L978-4(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point L978-6(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point L978-8(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point L978-10(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point L978-12(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point L978-14(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point L978-16(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point L978-18(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,162 INFO L444 ceAbstractionStarter]: For program point L978-20(lines 978 982) no Hoare annotation was computed. [2019-11-24 04:32:49,163 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,163 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 328) no Hoare annotation was computed. [2019-11-24 04:32:49,163 INFO L440 ceAbstractionStarter]: At program point L322-1(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~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)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0)) [2019-11-24 04:32:49,163 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:32:49,163 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1530) no Hoare annotation was computed. [2019-11-24 04:32:49,163 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,163 INFO L440 ceAbstractionStarter]: At program point L1382(lines 1374 1532) the Hoare annotation is: (and (<= (+ ~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) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,164 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,164 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,164 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 204) no Hoare annotation was computed. [2019-11-24 04:32:49,164 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,164 INFO L440 ceAbstractionStarter]: At program point L728(lines 728 776) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~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:49,164 INFO L440 ceAbstractionStarter]: At program point L1524(lines 1399 1525) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 (<= (+ ~NP~0 5) ~MPR3~0) .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 0) .cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (and (= 1 ~pended~0) .cse0 .cse1 .cse2 (<= (+ ~s~0 5) ~MPR3~0)))) [2019-11-24 04:32:49,165 INFO L440 ceAbstractionStarter]: At program point L733(lines 733 775) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~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:49,165 INFO L440 ceAbstractionStarter]: At program point L205(lines 205 424) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:49,165 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,165 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,165 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 343) no Hoare annotation was computed. [2019-11-24 04:32:49,165 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 343) no Hoare annotation was computed. [2019-11-24 04:32:49,165 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,165 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,166 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 423) no Hoare annotation was computed. [2019-11-24 04:32:49,166 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,166 INFO L440 ceAbstractionStarter]: At program point L1398(lines 1388 1528) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,166 INFO L440 ceAbstractionStarter]: At program point L738(lines 738 774) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~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:49,166 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 422) no Hoare annotation was computed. [2019-11-24 04:32:49,166 INFO L440 ceAbstractionStarter]: At program point L212(lines 208 423) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,166 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 421) no Hoare annotation was computed. [2019-11-24 04:32:49,167 INFO L440 ceAbstractionStarter]: At program point L1007(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,167 INFO L440 ceAbstractionStarter]: At program point L1007-1(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,167 INFO L440 ceAbstractionStarter]: At program point L1007-2(lines 971 1035) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,167 INFO L440 ceAbstractionStarter]: At program point L1007-3(lines 971 1035) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 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)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,167 INFO L440 ceAbstractionStarter]: At program point L1007-4(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,168 INFO L440 ceAbstractionStarter]: At program point L1007-5(lines 971 1035) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~s~0 2) ~MPR1~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0))) (.cse7 (<= (+ ~NP~0 2) ~s~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse0 (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-24 04:32:49,168 INFO L440 ceAbstractionStarter]: At program point L1007-6(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,168 INFO L440 ceAbstractionStarter]: At program point L1007-7(lines 971 1035) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-11-24 04:32:49,168 INFO L440 ceAbstractionStarter]: At program point L743(lines 743 773) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~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:49,168 INFO L440 ceAbstractionStarter]: At program point L1007-8(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,169 INFO L440 ceAbstractionStarter]: At program point L1007-9(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,169 INFO L440 ceAbstractionStarter]: At program point L1007-10(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-24 04:32:49,169 INFO L440 ceAbstractionStarter]: At program point L83(lines 705 777) the Hoare annotation is: (let ((.cse1 (+ ~s~0 5)) (.cse0 (+ ~s~0 2))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= .cse0 ~SKIP2~0) (<= .cse1 ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 ~MPR3~0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse0 ~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:49,169 INFO L444 ceAbstractionStarter]: For program point L1273(lines 1273 1285) no Hoare annotation was computed. [2019-11-24 04:32:49,169 INFO L444 ceAbstractionStarter]: For program point L1273-2(lines 1272 1561) no Hoare annotation was computed. [2019-11-24 04:32:49,169 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,169 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 420) no Hoare annotation was computed. [2019-11-24 04:32:49,170 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,170 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:32:49,170 INFO L440 ceAbstractionStarter]: At program point L218(lines 214 421) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-11-24 04:32:49,170 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,170 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,170 INFO L440 ceAbstractionStarter]: At program point L220(lines 220 419) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,170 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,170 INFO L444 ceAbstractionStarter]: For program point L1278(lines 1278 1283) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-1(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-2(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-3(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-4(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-5(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-6(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-7(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-8(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,171 INFO L444 ceAbstractionStarter]: For program point L1015-9(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,172 INFO L444 ceAbstractionStarter]: For program point L1015-10(lines 1015 1032) no Hoare annotation was computed. [2019-11-24 04:32:49,172 INFO L440 ceAbstractionStarter]: At program point L223(lines 223 418) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,172 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 501) no Hoare annotation was computed. [2019-11-24 04:32:49,172 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 364) no Hoare annotation was computed. [2019-11-24 04:32:49,172 INFO L440 ceAbstractionStarter]: At program point L226(lines 225 418) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~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) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-11-24 04:32:49,172 INFO L444 ceAbstractionStarter]: For program point L625(lines 625 627) no Hoare annotation was computed. [2019-11-24 04:32:49,172 INFO L444 ceAbstractionStarter]: For program point L494(lines 494 500) no Hoare annotation was computed. [2019-11-24 04:32:49,172 INFO L440 ceAbstractionStarter]: At program point L494-1(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~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)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0)) [2019-11-24 04:32:49,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,173 INFO L444 ceAbstractionStarter]: For program point L1552(lines 1552 1558) no Hoare annotation was computed. [2019-11-24 04:32:49,173 INFO L440 ceAbstractionStarter]: At program point L1552-1(lines 1552 1558) the Hoare annotation is: (let ((.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= ~s~0 ~DC~0)) (.cse5 (= 1 ~pended~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse1 (+ ~s~0 5))) (or (and (= 0 ~pended~0) .cse0 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) (<= .cse1 ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse2 .cse3 (<= (+ ~NP~0 4) ~MPR1~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (and .cse5 .cse4 .cse0 .cse2 .cse3) (and .cse5 (= ~s~0 ~NP~0) .cse0 .cse2 (<= .cse1 ~MPR3~0)))) [2019-11-24 04:32:49,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,173 INFO L444 ceAbstractionStarter]: For program point L1024(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,173 INFO L444 ceAbstractionStarter]: For program point L1024-2(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,173 INFO L444 ceAbstractionStarter]: For program point L1024-4(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,173 INFO L444 ceAbstractionStarter]: For program point L1024-6(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point L1024-8(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point L1024-10(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point L1024-12(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point L1024-14(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point L1024-16(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point L1024-18(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point L1024-20(lines 1024 1031) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,174 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-11-24 04:32:49,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:32:49 BoogieIcfgContainer [2019-11-24 04:32:49,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:32:49,282 INFO L168 Benchmark]: Toolchain (without parser) took 36162.33 ms. Allocated memory was 138.9 MB in the beginning and 735.1 MB in the end (delta: 596.1 MB). Free memory was 101.7 MB in the beginning and 259.7 MB in the end (delta: -158.0 MB). Peak memory consumption was 583.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:49,283 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 04:32:49,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.61 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 168.7 MB in the end (delta: -67.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:49,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.36 ms. Allocated memory is still 203.9 MB. Free memory was 168.7 MB in the beginning and 157.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:49,284 INFO L168 Benchmark]: Boogie Preprocessor took 120.72 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 150.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:49,284 INFO L168 Benchmark]: RCFGBuilder took 2926.98 ms. Allocated memory was 203.9 MB in the beginning and 255.3 MB in the end (delta: 51.4 MB). Free memory was 150.8 MB in the beginning and 153.0 MB in the end (delta: -2.2 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:49,285 INFO L168 Benchmark]: TraceAbstraction took 32223.11 ms. Allocated memory was 255.3 MB in the beginning and 735.1 MB in the end (delta: 479.7 MB). Free memory was 153.0 MB in the beginning and 259.7 MB in the end (delta: -106.7 MB). Peak memory consumption was 518.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:32:49,287 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.21 ms. Allocated memory is still 138.9 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.61 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 168.7 MB in the end (delta: -67.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 127.36 ms. Allocated memory is still 203.9 MB. Free memory was 168.7 MB in the beginning and 157.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.72 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 150.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2926.98 ms. Allocated memory was 203.9 MB in the beginning and 255.3 MB in the end (delta: 51.4 MB). Free memory was 150.8 MB in the beginning and 153.0 MB in the end (delta: -2.2 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32223.11 ms. Allocated memory was 255.3 MB in the beginning and 735.1 MB in the end (delta: 479.7 MB). Free memory was 153.0 MB in the beginning and 259.7 MB in the end (delta: -106.7 MB). Peak memory consumption was 518.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 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) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && 0 == pended) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && 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: 1064]: Loop Invariant Derived loop invariant: (((((((((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && ntStatus == __cil_tmp30) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && 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: 205]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus + 1 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 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) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 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) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) || ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && ntStatus == __cil_tmp30) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) || ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1592]: Loop Invariant Derived loop invariant: ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) || (((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1346]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && 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: 972]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((((((((((NP + 2 <= SKIP1 && (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) && 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) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && s == NP) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 705]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status <= lowerDriverReturn) && lowerDriverReturn <= status - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 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) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && (s == NP || 259 <= returnVal2)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && 1 == compRegistered) && (s == NP || returnVal2 <= 259)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered - InvariantResult [Line: 1319]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((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) || (((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((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 && lowerDriverReturn == status) && DC + 2 <= s) && DC + 5 <= IPC) && 0 == pended) && \result == lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || ((0 == pended && status == 0) && s == DC)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || ((((((((((((((NP + 2 <= SKIP1 && DC + 2 <= s) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || ((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((0 == pended && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((((((((((((((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: 529]: Loop Invariant Derived loop invariant: (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 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) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && s == NP) && DC + 2 <= SKIP2) && ntStatus <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 786]: Loop Invariant Derived loop invariant: ((((((((((((((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && 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) && SKIP1 + 2 <= MPR1) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || ((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && IPC == s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 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)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (status == 0 && s == DC) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && 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: 548]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus + 1 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 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) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && 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) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((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) || (((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 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) && 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)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || ((0 == pended && status == 0) && s == DC)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && \result == lowerDriverReturn) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((1 == pended && s == NP) && 0 == compRegistered) && s + 5 <= MPR3)) || ((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((0 == pended && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((((((((((((((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: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && NP + 5 <= MPR3) && 0 == pended) && s + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && ntStatus == __cil_tmp30)) || ((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) - InvariantResult [Line: 1374]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1328]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((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) && ntStatus <= 0) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && (s == NP || 259 <= returnVal2)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && ((returnVal2 <= 258 || 259 < returnVal2) || MPR3 == s)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && (s == NP || returnVal2 <= 259)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 796]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (\result <= 258 || 260 <= \result)) || ((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && DC + 2 <= s) && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && 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 && (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)) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (1 == pended && NP + 5 <= MPR3)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 2 <= s) && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (status == 0 && s == DC) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && 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: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && (s == NP || 259 <= returnVal2)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((returnVal2 <= 258 || 259 < returnVal2) || MPR3 == s)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && (s == NP || returnVal2 <= 259)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0)) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status == 0) && s == DC) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1388]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && 0 == compRegistered) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC - InvariantResult [Line: 1181]: Loop Invariant Derived loop invariant: ((((((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || ((((((((((((NP + 2 <= SKIP1 && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || (((((((((((((0 == pended && 0 == compRegistered) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && status == 0) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && ntStatus <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 351 locations, 53 error locations. Result: SAFE, OverallTime: 32.0s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.4s, HoareTripleCheckerStatistics: 11916 SDtfs, 9001 SDslu, 16681 SDs, 0 SdLazy, 5003 SolverSat, 569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 49 MinimizatonAttempts, 777 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 114 LocationsWithAnnotation, 114 PreInvPairs, 347 NumberOfFragments, 10924 HoareAnnotationTreeSize, 114 FomulaSimplifications, 7809671 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 114 FomulaSimplificationsInter, 1467986 FormulaSimplificationTreeSizeReductionInter, 17.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1318 ConstructedInterpolants, 0 QuantifiedInterpolants, 107766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 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...